Robustly good trellis codes

Author

Fu-Quan Wang ; Costello, D.J., Jr.

Author_Institution

Dept. of Electr. Eng., Notre Dame Univ., IN, USA

Volume

44

Issue

7

fYear

1996

fDate

7/1/1996 12:00:00 AM

Firstpage

791

Lastpage

798

Abstract

The relationship between the distance properties of trellis codes and the computational effort and error performance of sequential decoding is studied and optimum distance profile (ODP) and optimum free distance (OFD) trellis codes are constructed for 8-PSK and 16 QAM modulation. A comparison of the performance of both the ODP and the OFD trellis codes reveals that neither class of codes results in the best trade-off between error performance and computational effort when sequential decoding is used. A new algorithm is then proposed to construct robustly good trellis codes for use with sequential decoding. New trellis codes with asymptotic coding gains up to 6.66 dB are obtained using this algorithm, and the new codes achieve nearly the same free distances as the OFD codes and nearly the same distance profiles as the ODP codes.

Keywords

computational complexity; phase shift keying; quadrature amplitude modulation; sequential decoding; trellis coded modulation; 16 QAM; 8-PSK; asymptotic coding gains; computational effort; distance properties; error performance; optimum distance profile; optimum free distance; robustly good trellis codes; sequential decoding; Computational complexity; Convolutional codes; Decision trees; Decoding; Euclidean distance; Hardware; Modulation coding; Robustness; Two dimensional displays; Viterbi algorithm;

fLanguage

English

Journal_Title

Communications, IEEE Transactions on

Publisher

ieee

ISSN

0090-6778

Type

jour

DOI

10.1109/26.508298

Filename

508298