Efficient joint source-channel decoding of multi-state Markov sequences

In this study, joint source-channel decoding for non-binary source samples is conducted. The non-binary source samples can be modelled as the output of a multi-state Markov chain (MC). As the source samples are directly transmitted after channel coding without source compression, the transmitted signals can be highly correlated. At the receiver, the multi-state MC module can be designed to exploit the statistical correlation of source samples to improve the error correcting performance. However, as the number of states is increased, the multi-state MC module requires high computational complexity. To alleviate this problem, a simplified MC module is proposed. In the simplified MC module, the multi-state MC is replaced with multiple number of two-state MCs each of which exploits bit-level correlation of samples. Simulation results demonstrate that the simplified MC module can lead to competitive reduction in the required signal-to-noise ratio in comparison with the multi-state MC module with reduced computational complexity.

[1]  Si-Woong Lee,et al.  Spatial error concealment method based on POCS with a correlation-based initial block , 2007 .

[2]  Farshad Lahouti,et al.  Distributed source coding using symbol-based and non-binary turbo codes - applications to wireless sensor networks , 2008, IET Commun..

[3]  Sang Joon Kim,et al.  A Mathematical Theory of Communication , 2006 .

[4]  Javier Garcia-Frías,et al.  Joint turbo decoding and estimation of hidden Markov sources , 2001, IEEE J. Sel. Areas Commun..

[5]  H. Vincent Poor,et al.  Joint Source and Channel Coding , 2010, IEEE Signal Processing Magazine.

[6]  R.J. Sclabassi,et al.  Low Power Digital Communication in Implantable Devices Using Volume Conduction of Biological Tissues , 2006, 2006 International Conference of the IEEE Engineering in Medicine and Biology Society.

[7]  Yanling Xu,et al.  Adaptive temporal error concealment scheme for H.264/AVC video decoder , 2008, IEEE Transactions on Consumer Electronics.

[8]  Mingui Sun,et al.  A Power-Efficient Communication System between Brain-Implantable Devices and External Computers , 2007, 2007 29th Annual International Conference of the IEEE Engineering in Medicine and Biology Society.

[9]  Sergio Verdú,et al.  The source-channel separation theorem revisited , 1995, IEEE Trans. Inf. Theory.

[10]  Zixiang Xiong,et al.  A distributed source coding technique for correlated images using turbo-codes , 2002, IEEE Communications Letters.

[11]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[12]  Zixiang Xiong,et al.  Distributed source coding for sensor networks , 2004, IEEE Signal Processing Magazine.

[13]  L. Baum,et al.  A Maximization Technique Occurring in the Statistical Analysis of Probabilistic Functions of Markov Chains , 1970 .

[14]  Robert G. Gallager,et al.  Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.

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

[16]  Alain Glavieux,et al.  Reflections on the Prize Paper : "Near optimum error-correcting coding and decoding: turbo codes" , 1998 .

[17]  Robert Sabourin,et al.  On the memory complexity of the forward-backward algorithm , 2010, Pattern Recognit. Lett..

[18]  Guosen Yue,et al.  Analysis and Design of Finite-Length LDPC Codes , 2007, IEEE Transactions on Vehicular Technology.

[19]  Ying Zhao,et al.  Joint estimation and compression of correlated nonbinary sources using punctured turbo codes , 2005, IEEE Transactions on Communications.

[20]  Yao Wang,et al.  Error control and concealment for video communication: a review , 1998, Proc. IEEE.

[21]  Joachim Hagenauer,et al.  Rate-compatible punctured convolutional codes (RCPC codes) and their applications , 1988, IEEE Trans. Commun..

[22]  J. Woods,et al.  Probability and Random Processes with Applications to Signal Processing , 2001 .