Soft decision iterative error and erasure decoder for Reed–Solomon codes

• Published in: IET communications Vol. 8; no. 16; pp. 2863 - 2870
• Main Authors: Ur-Rehman, Obaid, Zivic, Natasa
• Format: Journal Article
• Language: English
• Published: The Institution of Engineering and Technology 06.11.2014
• Subjects: algebraic codes; algebraic hard decision RS decoder; Algorithms; Channels; Complexity; Decoders; Decoding; erasure decoder; Gain; iteration complexity; iterative decoding; iterative soft decision decoding; least reliable symbols; list decoding algorithm; minimum Hamming distance; Modulation; received sequence; Reed‐Solomon codes; soft decision iterative error; symbol error correction capability; Symbols; least reliable symbols; iterative soft decision decoding; symbol error correction capability; iteration complexity; Reed-Solomon codes; iterative decoding; received sequence; soft decision iterative error; algebraic hard decision RS decoder; minimum Hamming distance; erasure decoder; list decoding algorithm; algebraic codes
• ISSN: 1751-8628; 1751-8636; 1751-8636
• DOI: 10.1049/iet-com.2014.0033

A list decoding algorithm for iterative soft-decision decoding of Reed–Solomon (RS) codes is proposed in this study. The algorithm erases a combination of least reliable symbols and iteratively flips a new combination of least reliable bits in the received sequence. The symbol error correction capability of the algebraic hard decision RS decoder is extended up to the minimum Hamming distance of the code. A gain in performance is exhibited either at a lower or similar iteration complexity as compared to other iterative soft decision decoders of similar type. A complexity comparison with some of the comparable soft decision decoders is given. Simulation results for different modulation schemes and channel types are presented in this study for a comparison with other soft decision decoders of a similar kind.