Trellises and Trellis-Based Decoding Algorithms for Linear Block Codes. Part 3; The Map and Related Decoding Algirithms
Author | : National Aeronautics and Space Administration (NASA) |
Publisher | : Createspace Independent Publishing Platform |
Total Pages | : 50 |
Release | : 2018-08-20 |
ISBN-10 | : 1722916788 |
ISBN-13 | : 9781722916787 |
Rating | : 4/5 (88 Downloads) |
Book excerpt: 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. In this chapter, we first present a decoding algorithm which both minimizes bit error probability, and provides the corresponding soft information at the output of the decoder. This algorithm is referred to as the MAP (maximum aposteriori probability) decoding algorithm. Lin, Shu and Fossorier, Marc Goddard Space Flight Center NAG5-931; NAG5-2938...