By Topic

Systematically Re-encoded Algebraic Soft-Decision Reed–Solomon Decoder

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)
Xinmiao Zhang ; Case Western Reserve University, Cleveland, OH, USA ; Yu Zheng

To reduce the complexity of algebraic soft-decision decoding (ASD) of Reed-Solomon (RS) codes, re-encoding and coordinate transformation can be applied. For an (n, k) code, the re-encoding was implemented as applying erasure decoding to the k most reliable code positions previously. Such re-encoding can occupy a significant part of the overall decoder area. In this brief, we propose to choose the first k positions and implement the re-encoding in the low-complexity Chase (LCC) ASD algorithm by systematic encoding, which can be done by simple constant multipliers. Moreover, novel schemes are developed to modify the following interpolation and codeword recovery steps in the case that systematic symbols need to be flipped to form the test vectors in the LCC decoding. Without any performance loss, the proposed schemes can lead to 15.5% higher efficiency in terms of throughput-over-area ratio in the LCC decoder with eight test vectors for a (255, 239) RS code over GF(28).

Published in:

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