Special Section on VLSI Design and CAD Algorithms
Low Complexity Reed-Solomon Decoder Design with Pipelined Recursive Euclidean Algorithm
2016 Volume E99.A Issue 12 Pages 2453-2462
Details
2016 Volume E99.A Issue 12 Pages 2453-2462
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.
