Adaptive Exploitation of Residual Redundancy in Iterative Source-Channel Decoding

Iterative source-channel decoding (ISCD) aims at the exploitation of the time-variant residual redundancy of the source samples, e.g., source codec parameters, for error concealment and quality improvements. In most previous publications the receiver had perfect knowledge of the amount of residual redundancy. This assumption would require a reliable, i.e. highly redundant, transmission of side information. In contrast, in this paper we present a relatively simple scheme, yet efficient and robust, by which the residual redundancy at the receiver can be estimated accurately without any side information, and then can be exploited adaptively. We present the achievable performance gains in an ISCD system including the estimation of the residual source redundancy at the receiver for various scenarios. Several methods of different performance and computational complexity are proposed, with some of them even outperforming a system with perfect side information. The latter, not quite intuitive fact, is explained in the paper.

[1]  Peter Vary,et al.  Softbit speech decoding: a new approach to error concealment , 2001, IEEE Trans. Speech Audio Process..

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

[3]  Peter Vary,et al.  Digital Speech Transmission: Enhancement, Coding and Error Concealment , 2006 .

[4]  Norbert Goertz On the iterative approximation of optimal joint source-channel decoding , 2001, IEEE J. Sel. Areas Commun..

[5]  Peter Vary,et al.  Iterative Source-Channel Decoding Using Short Block Codes , 2006, 2006 IEEE International Conference on Acoustics Speech and Signal Processing Proceedings.

[6]  Peter Vary,et al.  Iterative Source-Channel Decoding: Improved System Design Using EXIT Charts , 2005, EURASIP J. Adv. Signal Process..

[7]  Judea Pearl,et al.  Probabilistic reasoning in intelligent systems - networks of plausible inference , 1991, Morgan Kaufmann series in representation and reasoning.

[8]  Shu Lin,et al.  Iterative decoding of one-step majority logic deductible codes based on belief propagation , 2000, IEEE Trans. Commun..

[9]  P. Vary,et al.  Parameter SNR Optimized Index Assignments and Quantizers based on First Order A Priori Knowledge for Iterative Source-Channel Decoding , 2006, 2006 40th Annual Conference on Information Sciences and Systems.

[10]  David J. C. MacKay,et al.  Good Error-Correcting Codes Based on Very Sparse Matrices , 1997, IEEE Trans. Inf. Theory.

[11]  Norbert Görtz Optimization of Bit Mappings for Iterative Source-Channel Decoding , 2003 .

[12]  Peter Vary,et al.  Combined Iterative Demodulation and Decoding using very short LDPC Codes and Rate-1 Convolutional Codes , 2005 .

[13]  E. Weldon Difference-set cyclic codes , 1966 .

[14]  Fred Daneshgaran,et al.  LDPC-based channel coding of correlated sources with iterative joint decoding , 2006, IEEE Transactions on Communications.

[15]  Peter Vary,et al.  Iterative source-channel decoder using extrinsic information from softbit-source decoding , 2001, 2001 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings (Cat. No.01CH37221).

[16]  Suquan Ding Iterative Decoding of L-step Majority-Logic Decodable Codes Based on Belief Propagation , 2007, International Conference on Wireless Communications, Networking and Mobile Computing.