Analysis and Design of Trellis Codes Optimized for a Binary Symmetric Markov Source with MAP Detection

We consider the problem of transmitting a binary symmetric Markov source (BSMS), over the additive white Gaussian noise (AWGN) channel. The coding technique considered is trellis-coded modulation (TCM), where we utilize decoders which implement the maximum-likelihood (ML) and maximum a posteriori (MAP) criteria. Employing 8-PSK Ungerboeck codes on a BSMS with state transition probability 0.1, we first show that the MAP decoder realizes a 0.8-2.1-dB coding gain over the ML decoder. Motivated by these gains, we consider the design of trellis codes optimized for the BSMS/AWGN/MAP system. An approximate union bound is established for this system. Using this bound, we found codes which exhibit additional 0.4-1.1-dB gains over Ungerboeck codes. Finally, we compare the proposed TCM system with a tandem coding system. At normalized signal-to-noise ratio (SNR) of 10.8 dB and below, the proposed system significantly outperforms the tandem system.

[1]  Khalid Sayood,et al.  Use of residual redundancy in the design of joint source/channel coders , 1991, IEEE Trans. Commun..

[2]  G. David Forney,et al.  Trellis precoding: Combined coding, precoding and shaping for intersymbol interference channels , 1992, IEEE Trans. Inf. Theory.

[3]  T.E. Fuja,et al.  Channel codes that exploit the residual redundancy in CELP-encoded speech , 1996, IEEE Trans. Speech Audio Process..

[4]  Fady Alajaji,et al.  Sequence MAP decoding of trellis codes for Gaussian and Rayleigh channels , 1999 .

[5]  Gottfried Ungerboeck,et al.  Channel coding with multilevel/phase signals , 1982, IEEE Trans. Inf. Theory.

[6]  N. Phamdo,et al.  Optimal Detection of Discrete Markov Sources Over Discrete Memoryless Channels - Applications to Combined Source-Channel Coding , 1993, Proceedings. IEEE International Symposium on Information Theory.

[7]  Nam C. Phamdo,et al.  Optimal detection of discrete Markov sources over discrete memoryless channels - applications to combined source-channel coding , 1994, IEEE Trans. Inf. Theory.

[8]  Daniel J. Costello,et al.  An algorithm for computing the distance spectrum of trellis codes , 1989, IEEE Journal on Selected Areas in Communications.

[9]  Joachim Hagenauer,et al.  Joint source-channel decoding using the residual redundancy in compressed images , 1996, Proceedings of ICC/SUPERCOMM '96 - International Conference on Communications.

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

[11]  Richard E. Ladner,et al.  Codebook organization to enhance maximum a posteriori detection of progressive transmission of vector quantized images over noisy channels , 1993, 1993 IEEE International Conference on Acoustics, Speech, and Signal Processing.