Computer Science – Information Theory
Scientific paper
2005-09-29
IEEE Journal on Selected Areas in Communications, Volume 24, Issue 3, March 2006 Page(s):481 - 490
Computer Science
Information Theory
Submitted to IEEE for publication in Jan 2005
Scientific paper
10.1109/JSAC.2005.862399
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.
El-Khamy Mostafa
McEliece Robert J.
No associations
LandOfFree
Iterative Algebraic Soft-Decision List Decoding of Reed-Solomon Codes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Iterative Algebraic Soft-Decision List Decoding of Reed-Solomon Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Iterative Algebraic Soft-Decision List Decoding of Reed-Solomon Codes will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-459667