Conference
On the Complexity of Joint Source-Channel Decoding of Markov Sequences Over Memoryless Channels
Abstract
We investigate the complexity of joint source-channel maximum a posteriori (MAP) decoding of a Markov sequence which is first encoded by a source code, then encoded by a convolutional code, and sent through a noisy memoryless channel. As established previously the MAP decoding can be performed by a Viterbi-like algorithm on a trellis whose states are triples of the states of the Markov source, source coder and convolutional coder. The large …
Authors
Dumitrescu S; Wu X
Pagination
pp. 1666-1670
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Publication Date
January 1, 2005
DOI
10.1109/isit.2005.1523628
Name of conference
Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.