Distributed joint source-channel code for spatial-temporally correlated Markov sources

A new distributed joint source-channel code (DJSCC) is proposed for a communication network with spatial-temporally correlated Markov sources. The DJSCC is performed by puncturing the information bits of a systematic linear block code but leaving the parity bits intact, and transmitting the information and parity bits with unequal energy allocations. At the receiver, the spatial data correlation is exploited with a new multi-codeword message passing (MCMP) decoding algorithm. The MCMP decoder performs decoding by exchanging information between codewords from correlated sources, whereas conventional message passing (MP) algorithms exchanges soft information only inside a codeword. The inter-codeword soft information exchange of MCMP yields additional performance gains over the MP algorithm. In recognition that the signals at the receiver are distorted observations of the Markov source and thus can be modeled by a hidden Markov model (HMM), we propose to exploit the temporal data correlation by adding a HMM decoding module to the MCMP decoder. The HMM decoder iteratively exchanges soft information with the MCMP decoder, and this results in significant performance gains over conventional systems.

[1]  Lin Zhang,et al.  A distributed joint source-channel coding scheme for multiple correlated sources , 2009, 2009 Fourth International Conference on Communications and Networking in China.

[2]  Kannan Ramchandran,et al.  Distributed source coding using syndromes (DISCUS): design and construction , 2003, IEEE Trans. Inf. Theory.

[3]  Jack K. Wolf,et al.  Noiseless coding of correlated information sources , 1973, IEEE Trans. Inf. Theory.

[4]  Shrish Verma,et al.  Joint source-channel decoding of IRA code for hidden Markov source , 2012, 2012 1st International Conference on Recent Advances in Information Technology (RAIT).

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

[6]  Brendan J. Frey,et al.  Factor graphs and the sum-product algorithm , 2001, IEEE Trans. Inf. Theory.

[7]  Zixiang Xiong,et al.  Compression of binary sources with side information at the decoder using LDPC codes , 2002, IEEE Communications Letters.

[8]  J. L. Smith,et al.  Approximate Stationary Probability Vectors of a Finite Markov Chain , 1971 .

[9]  Pradeepa Yahampath,et al.  Distributed joint source-channel coding of correlated binary sources in wireless sensor networks , 2011, 2011 8th International Symposium on Wireless Communication Systems.

[10]  Hai Lin,et al.  Distributed joint source and channel code with correlated information sources , 2012, 2012 1st IEEE International Conference on Communications in China (ICCC).

[11]  Liuguo Yin,et al.  Combined hidden Markov source estimation and low-density parity-check coding: a novel joint source-channel coding scheme for multimedia communications , 2002, Wirel. Commun. Mob. Comput..

[12]  Pier Luigi Dragotti,et al.  Symmetric and asymmetric Slepian-Wolf codes with systematic and nonsystematic linear codes , 2005, IEEE Communications Letters.