High-Speed Low-Complexity Architecture for Reed-Solomon Decoders

スポンサーリンク

概要

• 論文の詳細を見る

• 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 Truongs 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.

• 2010-07-01

著者

• Shieh Ming-der

  Department Of Electrical Engineering National Cheng Kung University

• LU Yung-Kuei

  Department of Electrical Engineering, National Cheng Kung University

• Lu Yung-kuei

  Department Of Electrical Engineering National Cheng Kung University

関連論文

• Blind Channel Estimation for SIMO-OFDM Systems without Cyclic Prefix
• Reducing Interconnect Complexity for Efficient Path Metric Memory Management in Viterbi Decoders
• Design of a High-Throughput CABAC Encoder
• High-Speed Low-Complexity Architecture for Reed-Solomon Decoders
• Reconfigurable Homogenous Multi-Core FFT Processor Architectures for Hybrid SISO/MIMO OFDM Wireless Communications
• Design and Implementation of a Low-Complexity Reed-Solomon Decoder for Optical Communication Systems
• Low-Complexity Memory Access Architectures for Quasi-Cyclic LDPC Decoders

スポンサーリンク