• DocumentCode
    1166811
  • Title

    Design of the (248,216) Reed-Solomon decoder with erasure correction for Blu-ray disc

  • Author

    Park, Taegeun

  • Author_Institution
    Dept. of Inf., Commun., & Electron. Eng., Korea Catholic Univ., South Korea
  • Volume
    51
  • Issue
    3
  • fYear
    2005
  • Firstpage
    872
  • Lastpage
    878
  • Abstract
    This paper presents an efficient VLSI architecture of the (248, 216) Reed-Solomon decoder with erasure correction capability for Blu-ray disc (BD). The proposed architecture is designed with four-stage pipelines: the syndrome and erasure location polynomials calculation, the errata location polynomial calculation, the errata evaluation polynomial calculation, and the Chien search and errata value evaluation. Each stage is carefully balanced to maximize the throughput of the pipeline for BD applications. To solve the key equation, the Berlekamp-Massey algorithm is transformed into a symbol-serial structure and the fully utilized VLSI architecture, maintaining the maximum decoding performance, is proposed. Therefore, the proposed architecture maximizes the throughputs requiring less hardware resources. The gate counts for the proposed RS decoder is 74K using the Hynix 0.35 μm standard cell library and the maximum throughput is 700 Mbps at 100 MHz, which is fast enough for 16× BD applications.
  • Keywords
    Reed-Solomon codes; VLSI; decoding; error correction; optical disc storage; polynomials; 100 MHz; 700 Mbit/s; Berlekamp-Massey algorithm; Blu-ray disc; Chien search evaluation; Reed-Solomon decoder; VLSI architecture; decoding performance; erasure correction; errata value evaluation; four-stage pipelines; polynomials calculation; standard cell library; Decoding; Error correction codes; High definition video; Optical recording; Pipelines; Polynomials; Reed-Solomon codes; TV broadcasting; Throughput; Very large scale integration;
  • fLanguage
    English
  • Journal_Title
    Consumer Electronics, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0098-3063
  • Type

    jour

  • DOI
    10.1109/TCE.2005.1510497
  • Filename
    1510497