Efficient architecture for algebraic soft‐decision decoding of Reed–Solomon codes

Abstract

Reed–Solomon (RS) codes possess excellent error correction capability. Algebraic soft-decision decoding (ASD) of RS codes can provide better correction performance than the hard-decision decoding (HDD). The low-complexity Chase (LCC) decoding has the lowest complexity cost and similar or even higher coding gain among all of the available ASD algorithms. Instead of employing complicated interpolation technique, the LCC decoding can be implemented based on the HDD. This study proposes a modified serial LCC decoder, which employs a novel syndrome calculation, polynomial selection, Chien search and Forney algorithm block. In addition, an improved two-dimensional optimisation is provided to reduce the hardware complexity of the proposed decoder. Compared with the previous design, the proposed decoder can improve about 1.27 times speed and obtain 1.29 times higher efficiency in terms of throughput-over-slice ratio.