Design and Implementation of a Low-Complexity Reed-Solomon Decoder for Optical Communication Systems

Ming-Der SHIEH  Yung-Kuei LU  

IEICE TRANSACTIONS on Information and Systems   Vol.E94-D   No.8   pp.1557-1564
Publication Date: 2011/08/01
Online ISSN: 1745-1361
DOI: 10.1587/transinf.E94.D.1557
Print ISSN: 0916-8532
Type of Manuscript: PAPER
Category: Computer System
channel decoder,  modified euclidean algorithm,  optical communication,  Reed-Solomon codes,  VLSI architectures,  

Full Text: PDF>>
Buy this Article

A low-complexity Reed-Solomon (RS) decoder design based on the modified Euclidean (ME) algorithm proposed by Truong is presented in this paper. Low complexity is achieved by reformulating Truong's ME algorithm using the proposed polynomial manipulation scheme so that a more compact polynomial representation can be derived. Together with the developed folding scheme and simplified boundary cell, the resulting design effectively reduces the hardware complexity while meeting the throughput requirements of optical communication systems. Experimental results demonstrate that the developed RS(255, 239) decoder, implemented in the TSMC 0.18 µm process, can operate at up to 425 MHz and achieve a throughput rate of 3.4 Gbps with a total gate count of 11,759. Compared to related works, the proposed decoder has the lowest area requirement and the smallest area-time complexity.