A Study on a VLSI Architecture for Reed-Solomon Decoder Based on the Berlekamp Algorithm

Berlekamp 알고리즘을 이용한 Reed-Solomon 복호기의 VLSI 구조에 관한 연구

  • 김용환 (서울대학교 제어계측공학과) ;
  • 정영모 (서울대학교 제어계측공학과) ;
  • 이상욱 (서울대학교 제어계측공학과)
  • Published : 1993.11.01

Abstract

In this paper, a VlSI architecture for Reed-Solomon (RS) decoder based on the Berlekamp algorithm is proposed. The proposed decoder provided both erasure and error correcting capability. In order to reduc the chip area, we reformulate the Berlekamp algorithm. The proposed algorithm possesses a recursive structure so that the number of cells for computing the errata locator polynomial can be reduced. Moreover, in our approach, only one finite field multiplication per clock cycle is required for implementation, provided an improvement in the decoding speed, and the overall architecture features parallel and pipelined structure, making a real time decoding possible. From the performance evaluation, it is concluded that the proposed VLSI architecture is more efficient in terms of VLSI implementation than the rcursive architecture based on the Euclid algorithm.

Keywords