Iterative decoding of differentially space-time coded multiple descriptions of images
ICME '03 Proceedings of the 2003 International Conference on Multimedia and Expo - Volume 2
Joint source-channel decoding of variable-length codes with soft information: a survey
EURASIP Journal on Applied Signal Processing
Joint source-channel coding by means of an oversampled filter bank code
EURASIP Journal on Applied Signal Processing
Progressive and error-resilient transmission strategies for VLC encoded signals over noisy channels
EURASIP Journal on Applied Signal Processing
Soft and joint source-channel decoding of quasi-arithmetic codes
EURASIP Journal on Applied Signal Processing
EURASIP Journal on Applied Signal Processing
An efficient variable-length code construction foriterative source-channel decoding
IEEE Transactions on Communications
IEEE Transactions on Communications
Optimized concatenated LDPC codes for joint source-channel coding
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3
EURASIP Journal on Advances in Signal Processing
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Performance bounds and distance spectra of variable length codes in turbo/concatenated systems
IEEE Transactions on Communications
Fast joint source-channel decoding of convolutional coded Markov sequences with Monge property
IEEE Transactions on Communications
Hi-index | 0.07 |
We analyze the dependencies between the variables involved in the source and channel coding chain. This analysis is carried out in the framework of Bayesian networks, which provide both an intuitive representation for the global model of the coding chain and a way of deriving joint (soft) decoding algorithms. Three sources of dependencies are involved in the chain: (1) the source model, a Markov chain of symbols; (2) the source coder model, based on a variable length code (VLC), for example a Huffman code; and (3) the channel coder, based on a convolutional error correcting code. Joint decoding relying on the hidden Markov model (HMM) of the global coding chain is intractable, except in trivial cases. We advocate instead an iterative procedure inspired from serial turbo codes, in which the three models of the coding chain are used alternately. This idea of using separately each factor of a big product model inside an iterative procedure usually requires the presence of an interleaver between successive components. We show that only one interleaver is necessary here, placed between the source coder and the channel coder. The decoding scheme we propose can be viewed as a turbo algorithm using alternately the intersymbol correlation due to the Markov source and the redundancy introduced by the channel code. The intermediary element, the source coder model, is used as a translator of soft information from the bit clock to the symbol clock