High-speed low-complexity architecture for reed-solomon decoders

Yung Kuei Lu, Ming Der Shieh

Research output: Contribution to journalArticlepeer-review

6 Citations (Scopus)

Abstract

This paper presents a high-speed, low-complexity VLSI architecture based on the modified Euclidean (ME) algorithm for Reed- Solomon decoders. The low-complexity feature of the proposed architecture is obtained by reformulating the error locator and error evaluator polynomials to remove redundant information in the ME algorithm proposed by Truong. This increases the hardware utilization of the processing elements used to solve the key equation and reduces hardware by 30.4%. The proposed architecture retains the high-speed feature of Truong's ME algorithm with a reduced latency, achieved by changing the initial settings of the design. Analytical results show that the proposed architecture has the smallest critical path delay, latency, and area-time complexity in comparison with similar studies. An example RS(255,239) decoder design, implemented using the TSMC 0.18 μm process, can reach a throughput rate of 3Gbps at an operating frequency of 375MHz and with a total gate count of 27,271.

Original languageEnglish
Pages (from-to)1824-1831
Number of pages8
JournalIEICE Transactions on Information and Systems
VolumeE93-D
Issue number7
DOIs
Publication statusPublished - 2010 Jul

All Science Journal Classification (ASJC) codes

  • Software
  • Hardware and Architecture
  • Computer Vision and Pattern Recognition
  • Electrical and Electronic Engineering
  • Artificial Intelligence

Fingerprint

Dive into the research topics of 'High-speed low-complexity architecture for reed-solomon decoders'. Together they form a unique fingerprint.

Cite this