Conference
Fast Length-Constrained MAP Decoding of Variable Length Coded Markov Sequences over Noisy Channels
Abstract
We consider the problem of maximum a posterior probability (MAP) decoding of a Markov sequence that is variable length coded and transmitted over a binary symmetric channel (BSC). The number of source symbols in the sequence, if made known to the decoder, can improve MAP decoding performance. But adding a sequence length constraint to MAP decoding problem increases its complexity. In this paper we convert the length-constrained MAP decoding …
Authors
Wang Z; Wu X; Dumitrescu S
Volume
1
Pagination
pp. 542-546
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Publication Date
January 1, 2004
DOI
10.1109/icc.2004.1312548
Name of conference
2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577)