Trellises and Trellis-Based Decoding Algorithms for Linear Block Codes. Part 3; An Iterative Decoding Algorithm for Linear Block Codes Based on a Low-

By: Nasa, National Aeronautics and Space Adm

For long linear block codes, maximum likelihood decoding based on full code trellises would be very hard to implement if not impossible. In this case, we may wish to trade error performance for the reduction in decoding complexity. Sub-optimum soft-decision decoding of a linear block code based on a low-weight sub-trellis can be devised to provide an effective trade-off between error performance and decoding complexity. This chapter presents such a suboptimal decoding algorithm for linear block codes. This decoding algorithm is iterative in nature and based on an optimality test. It has the following important features: (1) a simple method to generate a sequence of candidate code-words, one at a time, for test; (2) a sufficient condition for testing a candidate code-word for optimality; and (3) a low-weight sub-trellis search for finding the most likely (ML) code-word. Lin, Shu and Fossorier, Marc Goddard Space Flight Center NAG5-931; NAG5-2938...

• Format: Paperback
• Language: English
• ISBN: 1728906687
• ISBN13: 9781728906683
• Release Date: January 1
• Publisher: Independently Published
• Length: 26 Pages
• Weight: 0.19 lbs.
• Dimensions: 0.1" x 8.5" x 11.0"