Abstract
In a coded communication system with equiprobable signaling, MLD minimizes the word error probability and delivers the most likely codeword associated with the corresponding received sequence. This decoding has two drawbacks. First, minimization of the word error probability is not equivalent to minimization of the bit error probability. Therefore, MLD becomes suboptimum with respect to the bit error probability. Second, MLD delivers a hard-decision estimate of the received sequence, so that information is lost between the input and output of the ML decoder. This information is important in coded schemes where the decoded sequence is further processed, such as concatenated coding schemes, multi-stage and iterative decoding schemes.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer Science+Business Media New York
About this chapter
Cite this chapter
Lin, S., Kasami, T., Fujiwara, T., Fossorier, M. (1998). The Map and Related Decoding Algorithms. In: Trellises and Trellis-Based Decoding Algorithms for Linear Block Codes. The Springer International Series in Engineering and Computer Science, vol 443. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-5745-6_13
Download citation
DOI: https://doi.org/10.1007/978-1-4615-5745-6_13
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-7632-3
Online ISBN: 978-1-4615-5745-6
eBook Packages: Springer Book Archive