By Topic

Scalable 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
$33 $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 ; Case Western Reserve University, 10900 Euclid Avenue, Cleveland, OH 44106-7071, USA ; Xinmiao Zhang

Reed-Solomon (RS) codes can be found in many communication and digital storage applications. Among various decoding algorithms, algebraic soft-decision decoding (ASD) of RS codes can achieve very good performance with polynomial complexity. Interpolation is a major step of ASD algorithms. It has been shown that the architectures for interpolation with small multiplicities can achieve higher efficiency by using the newly developed Lee-OpsilaSullivan (LO) algorithm. The LO algorithm consists of generator construction and basis conversion steps and the achievable throughput is decided by the number of coefficients updated simultaneously in the basis conversion. This algorithm is scalable. In this paper, architectures with different numbers of coefficients updated in parallel in the basis conversion are discussed. For each case, optimized computation units and scheduling schemes are developed. Our results can serve as guidelines for picking proper interpolation architectures to satisfy given application requirements.

Published in:

Circuits and Systems, 2008. APCCAS 2008. IEEE Asia Pacific Conference on

Date of Conference:

Nov. 30 2008-Dec. 3 2008