Conference
Length-Constrained MAP Decoding Revisited
Abstract
In this paper, we consider the problem of length-constrained maximum a posterior (MAP) decoding of a Markov sequence that is variable length encoded and transmitted over a binary symmetric channel. We convert this problem into one of maximum-weight k-link path in a weighted directed acyclic graph. The induced graph optimization problem can be solved by a fast parameterized search algorithm that finds either the optimal solution with high …
Authors
Wang Z; Wu X; Dumitrescu S
Volume
1
Pagination
pp. 687-690
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Publication Date
January 1, 2004
DOI
10.1109/icme.2004.1394285
Name of conference
2004 IEEE International Conference on Multimedia and Expo (ICME) (IEEE Cat. No.04TH8763)