A low-complexity Reed-Solomon decoder using new key equation solver

This paper presents a low-complexity parallel Reed-Solomon (RS) (255,239) decoder architecture using a novel pipelined variable stages recursive Modified Euclidean (ME) algorithm for optical communication. The pipelined four-parallel syndrome generator is proposed. The time multiplexing and resource sharing schemes are used in the novel recursive ME algorithm to reduce the logic gate count. The new key equation solver can be shared by two decoder macro. A new Chien search cell which doesn't need initialization is proposed in the paper. The proposed decoder can be used for 2.5Gb/s data rates device. The decoder is implemented in Altera' Stratixll device. The resource utilization is reduced about 40% comparing to the conventional method.

[1]  Hanho Lee.  High-speed VLSI architecture for parallel Reed-Solomon decoder , 2003, Proceedings of the 2003 International Symposium on Circuits and Systems, 2003. ISCAS '03..

[2]  Leilei Song,et al.  10- and 40-Gb/s forward error correction devices for optical communications , 2002 .

[3]  M. Baba,et al.  Single-chip 10.7 gb/s FEC codec LSI using time-multiplexed RS decoder , 2001, Proceedings of the IEEE 2001 Custom Integrated Circuits Conference (Cat. No.01CH37169).

[4]  Hanho Lee.  A high-speed low-complexity Reed-Solomon decoder for optical communications , 2005, IEEE Trans. Circuits Syst. II Express Briefs.