Iterative Algebraic Soft-Decision List Decoding of Reed-Solomon Codes

MaRDI QIDQ3374406zbMATH OpenFDO

Authors Mostafa El-Khamy, Robert J. McEliece

Publication date 9 March 2006

Full work available at URL https://arxiv.org/abs/cs/0509097

zbMATH Keywords

Chernoff bound

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Bounds on codes (94B65) Decoding (94B35)

Abstract: In this paper, we present an iterative soft-decision decoding algorithm for Reed-Solomon 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 Reed-Solomon codes.

Recommendations

• A complexity-reduced interpolation algorithm for soft-decision decoding of Reed-Solomon codes
• Algebraic soft-decision decoding of reed-solomon codes
• High-Throughput Interpolation Architecture for Algebraic Soft-Decision Reed–Solomon Decoding
• Algebraic soft- and hard-decision decoding of generalized Reed-Solomon and cyclic codes
• Algebraic Soft-Decision Decoding of Reed–Solomon Codes Using Bit-Level Soft Information
• Publication:4945377
• Performance Analysis of Algebraic Soft-Decision Decoding of Reed–Solomon Codes
• Exponential Error Bounds for Algebraic Soft-Decision Decoding of Reed–Solomon Codes
• Low-Complexity Soft-Decoding Algorithms for Reed–Solomon Codes—Part I: An Algebraic Soft-In Hard-Out Chase Decoder
• Bit-level soft-decision decoding of Reed-Solomon codes

Cited in

(8)

• On the automorphism group of a binary self-dual \([120, 60, 24]\) code
• Algebraic soft-decision decoding of reed-solomon codes
• Towards a VLSI architecture for interpolation-based soft-decision Reed-Solomon decoders
• Algebraic Soft-Decision Decoding of Reed–Solomon Codes Using Bit-Level Soft Information
• Using Lagrange's interpolation formula to construct Reed-Solomon codes over GF(p)
• A complexity-reduced interpolation algorithm for soft-decision decoding of Reed-Solomon codes
• Interpolation decoding
• scientific article; zbMATH DE number 2081134 (Why is no real title available?)

This page was built for publication: Iterative Algebraic Soft-Decision List Decoding of Reed-Solomon Codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3374406)