Tail Biting Trellis Representation of Codes: Decoding and Construction

By National Aeronautics and Space Administration

This paper presents two new iterative algorithms for decoding linear codes based on their tail biting trellises, one is unidirectional and the other is bidirectional. Both algorithms are computationally efficient and achieves virtually optimum error performance with a small number of decoding iterations. They outperform all the previous suboptimal decoding algorithms. The bidirectional algorithm also reduces decoding delay. Also presented in the paper is a method for constructing tail biting trellises for linear block codes.Shao. Rose Y. and Lin, Shu and Fossorier, MarcGoddard Space Flight CenterALGORITHMS; APPLICATIONS PROGRAMS (COMPUTERS); TRELLIS CODING; MATHEMATICAL MODELS; VITERBI DECODERS; COMPUTERIZED SIMULATION; FLOW CHARTS; ITERATION; BLOCK DIAGRAMS; MATRICES (MATHEMATICS); CONVOLUTION INTEGRALS...

• Format: Paperback
• Language: English
• ISBN: 1723892343
• ISBN13: 9781723892349
• Release Date: January 1
• Publisher: Independently Published
• Length: 52 Pages
• Weight: 0.32 lbs.
• Dimensions: 0.1" x 8.5" x 11.0"