By Topic

Efficient Reencoder Architectures for Algebraic 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

3 Author(s)
Xinmiao Zhang ; Case Western Reserve Univ., Cleveland, OH, USA ; Jiangli Zhu ; Wei Zhang

Algebraic soft-decision decoding (ASD) of Reed-Solomon (RS) codes can provide substantial coding gain with polynomial complexity. To reduce the complexity of ASD decoders, reencoding and coordinate transformation need to be applied, which require a reencoder and an erasure decoder. In the reencoded and transformed ASD decoders, these two blocks take a significant part of the overall decoder area and may limit the achievable throughput. In this brief, the reencoder design based on direct polynomial multiplication is further simplified by reformulating the involved equations. Moreover, two innovative area-reducing methods are proposed for the transformed coordinate computation. Efficient architectures are developed for the proposed schemes, and two reencoders are implemented using 0.18- CMOS technology. For a (255, 239) RS code, both reencoders can achieve throughput of at least 1.77 Gb/s and more than 30% higher efficiency in terms of throughput-over-area ratio than prior work. With minor modifications, the proposed design can also be employed to implement efficient erasure decoding.

Published in:

Circuits and Systems II: Express Briefs, IEEE Transactions on  (Volume:59 ,  Issue: 3 )