Iterative algebraic soft-decision list decoding of Reed-Solomon codes

Authors:
M. El-Khamy;R. J. McEliece
Affiliations:
Dept. of Electr. Eng., California Inst. of Technol., Pasadena, CA, USA;-
Venue:
IEEE Journal on Selected Areas in Communications
Year:
2006

Citing 0
Cited 11

A unified approach to the construction of binary and nonbinary quasi-cyclic LDPC codes based on finite fields

IEEE Transactions on Communications
Reed-Solomon codes implementing a coded single-carrier with cyclic prefix scheme

IEEE Transactions on Communications
High performance non-binary quasi-cyclic LDPC codes on euclidean geometries

IEEE Transactions on Communications
Construction of non-binary quasi-cyclic LDPC codes by arrays and array dispersions

IEEE Transactions on Communications
Turbo decoding of product codes using adaptive belief propagation

IEEE Transactions on Communications
A low complexity iterative technique for soft decision decoding of reed-solomon codes

ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Quasi-cyclic LDPC codes: an algebraic construction

IEEE Transactions on Communications
Stochastic chase decoding of reed-Solomon codes

IEEE Communications Letters
Low-complexity soft-decoding algorithms for Reed-Solomon codes-part II: soft-input soft-output iterative decoding

IEEE Transactions on Information Theory
Two low-complexity reliability-based message-passing algorithms for decoding non-binary LDPC codes

IEEE Transactions on Communications
A new rateless code with unequal error protection property

Computers and Electrical Engineering

Quantified Score

Hi-index	0.13

Visualization

Abstract

In this paper, we present an iterative soft-decision decoding algorithm for Reed-Solomon (RS) codes offering both complexity and performance advantages over previously known decoding algorithms. Our algorithm is a list decoding algorithm which combines two powerful soft-decision decoding techniques which were previously regarded in the literature as competitive, namely, the Koetter-Vardy algebraic soft-decision decoding algorithm and belief-propagation based on adaptive parity-check matrices, recently proposed by Jiang and Narayanan. Building on the Jiang-Narayanan algorithm, we present a belief-propagation-based algorithm with a significant reduction in computational complexity. We introduce the concept of using a belief-propagation-based decoder to enhance the soft-input information prior to decoding with an algebraic soft-decision decoder. Our algorithm can also be viewed as an interpolation multiplicity assignment scheme for algebraic soft-decision decoding of RS codes.