High-Speed Low-Complexity Reed-Solomon Decoder Using Pipelined Berlekamp-Massey Algorithm and Its Folded Architecture
In this paper, the authors present a high-speed low-complexity pipelined Reed-Solomon (RS) (255,239) decoder using pipelined Reformulated inversionless Berlekamp-Massey (pRiBM) algorithm and its folded version (PF-RiBM). Also, this paper offers efficient pipelining and folding technique of the RS decoders. This architecture uses pipelined Galois-Field (GF) multipliers in the syndrome computation block, Key Equation Solver (KES) block, Forney block, Chien search block and error correction block to enhance the clock frequency. A high-speed pipelined RS decoder based on the pRiBM algorithm and its folded version have been designed and implemented with 90- nm CMOS technology in a supply voltage of 1.1 V.