Channel coding with multilevel/phase signals
- 1 January 1982
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 28 (1) , 55-67
- https://doi.org/10.1109/tit.1982.1056454
Abstract
A coding technique is described which improves error performance of synchronous data links without sacrificing data rate or requiring more bandwidth. This is achieved by channel coding with expanded sets of multilevel/phase signals in a manner which increases free Euclidean distance. Soft maximum--likelihood (ML) decoding using the Viterbi algorithm is assumed. Following a discussion of channel capacity, simple hand-designed trellis codes are presented for 8 phase-shift keying (PSK) and 16 quadrature amplitude-shift keying (QASK) modulation. These simple codes achieve coding gains in the order of 3-4 dB. It is then shown that the codes can be interpreted as binary convolutional codes with a mapping of coded bits into channel signals, which we call "mapping by set partitioning." Based on a new distance measure between binary code sequences which efficiently lower-bounds the Euclidean distance between the corresponding channel signal sequences, a search procedure for more powerful codes is developed. Codes with coding gains up to 6 dB are obtained for a variety of multilevel/phase modulation schemes. Simulation results are presented and an example of carrier-phase tracking is discussed.Keywords
This publication has 7 references indexed in Scilit:
- A bandwidth-efficient class of signal-space codesIEEE Transactions on Information Theory, 1978
- On Improving Bit Error Probability of QPSK and 4-Level Amplitude Modulation Systems by Convolutional CodingIEEE Transactions on Communications, 1977
- Better phase-modulation error performance using trellis phase codesElectronics Letters, 1976
- Short binary convolutional codes with maximal free distance for rates 2/3 and 3/4 (Corresp.)IEEE Transactions on Information Theory, 1974
- The viterbi algorithmProceedings of the IEEE, 1973
- An efficient algorithm for computing free distance (Corresp.)IEEE Transactions on Information Theory, 1972
- Convolutional codes I: Algebraic structureIEEE Transactions on Information Theory, 1970