By Topic

Efficient Interpolation Architecture for Soft-Decision Reed-Solomon Decoding

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Jiangli Zhu ; Department of Electrical Engineering and Computer Science, Case Western Reserve University, 10900 Euclid Ave., Cleveland, OH 44106-7071 ; Xinmiao Zhang

Reed-Solomon (RS) codes can be found in many digital communication and storage systems. Recently, significant advancements have been made on algebraic soft-decision decoding (ASD) of RS codes. Among the ASD algorithms with practical multiplicity assignment scheme, the bit-level generalized minimum distance (BGMD) decoding algorithm can achieve similar or higher coding gain with lower complexity. Interpolation is one of the major steps in ASD algorithms. The newly proposed Lee-O'Sullivan (LO) interpolation algorithm is computationally simple, and thus can potentially lead to practical high-speed and small-area hardware implementation of the interpolation step. In this paper, a novel interpolation architecture for the BGMD decoder based on the LO algorithm is proposed. By exploiting the characteristics of the LO algorithm and the multiplicity assignment scheme in the BGMD decoder, the proposed interpolation architecture for a (255, 239) RS code can achieve 15% higher efficiency in terms of speed over area ratio than prior efforts.

Published in:

Signal Processing Systems, 2007 IEEE Workshop on

Date of Conference:

17-19 Oct. 2007