Conference
Fast Joint Source-Channel Decoding of Convolutional Coded Markov Sequences with Monge Property
Abstract
We address the problem 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. The existing joint source-channel decoding algorithm for the case of general convolutional encoder has $O(MK^{2} N)$ time complexity, where $M$ is the length in bits of the information sequence, $K$ is the size of the …
Authors
Dumitrescu S
Pagination
pp. 553-558
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Publication Date
January 1, 2007
DOI
10.1109/itw.2007.4313134
Name of conference
2007 IEEE Information Theory Workshop