Channel coding with multilevel/phase signals

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.

[1]  Jr. G. Forney,et al.  The viterbi algorithm , 1973 .

[2]  John B. Anderson,et al.  A bandwidth-efficient class of signal-space codes , 1978, IEEE Trans. Inf. Theory.

[3]  R. Gallager Information Theory and Reliable Communication , 1968 .

[4]  G. David Forney,et al.  Convolutional codes I: Algebraic structure , 1970, IEEE Trans. Inf. Theory.

[5]  W. Osborne,et al.  Coherent and Noncoherent Detection of CPFSK , 1974, IEEE Trans. Commun..

[6]  Tor Aulin,et al.  Minimum Euclidean Distance and Power Spectrum for a Class of Smoothed Phase Modulation Codes with Constant Envelope , 1982, IEEE Trans. Commun..

[7]  John B. Anderson Simulated error performance of multi-h phase codes , 1981, IEEE Trans. Inf. Theory.

[8]  J. B. Anderson,et al.  Better phase-modulation error performance using trellis phase codes , 1976 .

[9]  Tor Aulin,et al.  Power-Bandwidth Performance of Smoothed Phase Modulation Codes , 1981, IEEE Trans. Commun..

[10]  R. de Buda About Optimal Properties of Fast Frequency-Shift Keying , 1974, IEEE Trans. Commun..

[11]  A. Digeon On Improving Bit Error Probability of QPSK and 4-Level Amplitude Modulation Systems by Convolutional Coding , 1977, IEEE Trans. Commun..

[12]  T. Schonhoff Symbol Error Probabilities for M-ary CPFSK: Coherent and Noncoherent Detection , 1976, IEEE Trans. Commun..

[13]  Lalit R. Bahl,et al.  An efficient algorithm for computing free distance (Corresp.) , 1972, IEEE Trans. Inf. Theory.

[14]  Erik Paaske,et al.  Short binary convolutional codes with maximal free distance for rates 2/3 and 3/4 (Corresp.) , 1974, IEEE Trans. Inf. Theory.

[15]  I. M. Jacobs,et al.  Principles of Communication Engineering , 1965 .

[16]  Stephen G. Wilson,et al.  Error bounds for multi-h phase codes , 1982, IEEE Trans. Inf. Theory.