Low Complexity Reed-Solomon Decoder Design with Pipelined Recursive Euclidean Algorithm

Kazuhito ITO  

IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E99-A   No.12   pp.2453-2462
Publication Date: 2016/12/01
Online ISSN: 1745-1337
DOI: 10.1587/transfun.E99.A.2453
Type of Manuscript: Special Section PAPER (Special Section on VLSI Design and CAD Algorithms)
Reed-Solomon code,  key equation solver,  Euclidean algorithm,  pipelined recursive KES,  

Full Text: PDF(1.4MB)>>
Buy this Article

A Reed-Solomon (RS) decoder is designed based on the pipelined recursive Euclidean algorithm in the key equation solution. While the Euclidean algorithm uses less Galois multipliers than the modified Euclidean (ME) and reformulated inversionless Berlekamp-Massey (RiBM) algorithms, division between two elements in Galois field is required. By implementing the division with a multi-cycle Galois inverter and a serial Galois multiplier, the proposed key equation solver architecture achieves lower complexity than the conventional ME and RiBM based architectures. The proposed RS (255,239) decoder reduces the hardware complexity by 25.9% with 6.5% increase in decoding latency.