On constructing trellis codes with large free distances and low decoding complexities
- 1 January 1997
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 45 (9) , 1017-1020
- https://doi.org/10.1109/26.623062
Abstract
We propose a trellis-coding scheme for which large free distances and low decoding complexities can be easily achieved. The proposed trellis-coding scheme is a generalization of the trellis-coding scheme proposed by Hellstern (1993). With the proposed trellis-coding scheme, we have the flexibility of controlling the decoding delayKeywords
This publication has 8 references indexed in Scilit:
- Coded modulation with feedback decoding trellis codesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Multilevel codes based on partitioningIEEE Transactions on Information Theory, 1989
- Systolic array processing of the Viterbi algorithmIEEE Transactions on Information Theory, 1989
- Highly reliable multilevel channel coding system using binary convolutional codesElectronics Letters, 1987
- A Class of Optimum Block Codes in Signal SpaceIEEE Transactions on Communications, 1986
- Error control codes for QAM signallingElectronics Letters, 1984
- Channel coding with multilevel/phase signalsIEEE Transactions on Information Theory, 1982
- A new multilevel coding method using error-correcting codesIEEE Transactions on Information Theory, 1977