Title :
High-speed low-complexity Reed-Solomon decoder using pipelined Berlekamp-Massey algorithm
Author :
Park, Jeong-In ; Lee, Kihoon ; Choi, Chang-Seok ; Lee, Hanho
Author_Institution :
Dept. of Inf. & Commun. Eng., Inha Univ., Incheon, South Korea
Abstract :
This paper presents a high-speed low-complexity pipelined Reed-Solomon (RS) decoder using pipelined reformulated inversionless Berlekamp-Massey (pRiBM) algorithm. Also, this paper offers technique which is about efficient method of pipelining at the RS decoders. This architecture uses pipelined Galois-Field (GF) multipliers in Syndrome computation block, key equation solver (KES) block, Forney and Chien search blocks so as to enhance clock frequency. A high-speed pipelined RS decoder based on the pRiBM algorithm has been designed and implemented with IBM 90-nm CMOS standard cell technology in a supply voltage of 1.2 V. The proposed RS decoder operates at a clock frequency of 690 MHz and has a throughput of 5.52 Gb/s. The proposed architecture requires approximately 18% fewer gate counts than architecture based on the pipelined degree-computationless modified Euclidean (pDCME) algorithm.
Keywords :
Galois fields; Reed-Solomon codes; decoding; pipeline arithmetic; high-speed low-complexity Reed-Solomon decoder; key equation solver block; pipelined Berlekamp-Massey algorithm; pipelined Galois-Field multipliers; search blocks; syndrome computation block; Algorithm design and analysis; CMOS technology; Clocks; Computer architecture; Decoding; Equations; Frequency; Pipeline processing; Reed-Solomon codes; Voltage; Berlekamp-Massey algorithm; Reed-Solomon codes; VLSI; key equation solver; pipelined; syndrome;
Conference_Titel :
SoC Design Conference (ISOCC), 2009 International
Conference_Location :
Busan
Print_ISBN :
978-1-4244-5034-3
Electronic_ISBN :
978-1-4244-5035-0
DOI :
10.1109/SOCDC.2009.5423927