Joint source-channel decoding of entropy coded Markov sources over binary symmetric channels

This paper proposes an optimal joint source-channel, maximum a posteriori, decoder for entropy coded Markov sources transmitted over noisy channels. We introduce the concept of incomplete and complete states to deal with the problem of variable length source codes in the decoder. The proposed decoder is sequential, thereby making the expected delay finite. When compared to the traditional decoder, the proposed decoder shows a maximum improvement, of about 4 dB in a modified signal to noise ratio and an improvement of 21.95% in percentage of bits that are received in an out of synchronization condition, for a simple test source.

[1]  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.

[2]  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.

[3]  C. E. SHANNON,et al.  A mathematical theory of communication , 1948, MOCO.

[4]  Khalid Sayood,et al.  Joint source/channel coding for variable length codes , 1998, Proceedings DCC '98 Data Compression Conference (Cat. No.98TB100225).

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

[6]  K. P. Subbalakshmi,et al.  Optimal decoding of entropy coded memoryless sources over binary symmetric channels , 1998, Proceedings DCC '98 Data Compression Conference (Cat. No.98TB100225).