High-speed low-complexity Reed-Solomon decoder using pipelined Berlekamp-Massey algorithm

Jeong In Park, Kihoon Lee, Chang Seok Choi, Hanho Lee

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

16 Scopus citations

Abstract

This paper presents a high-speed low-complexity pipelined Reed-Solomon (RS) decoder using pipelined reformulated inversionless Berlekamp-Massey (pRiBM) algorithm. Also, this paper offers technique which is about efficient method of pipelining at the RS decoders. This architecture uses pipelined Galois-Field (GF) multipliers in Syndrome computation block, key equation solver (KES) block, Forney and Chien search blocks so as to enhance clock frequency. A high-speed pipelined RS decoder based on the pRiBM algorithm has been designed and implemented with IBM 90-nm CMOS standard cell technology in a supply voltage of 1.2 V. The proposed RS decoder operates at a clock frequency of 690 MHz and has a throughput of 5.52 Gb/s. The proposed architecture requires approximately 18% fewer gate counts than architecture based on the pipelined degree- computationless modified Euclidean (pDCME) algorithm [5].

Original languageEnglish
Title of host publication2009 International SoC Design Conference, ISOCC 2009
Pages452-455
Number of pages4
DOIs
StatePublished - 2009
Event2009 International SoC Design Conference, ISOCC 2009 - Busan, Korea, Republic of
Duration: 22 Nov 200924 Nov 2009

Publication series

Name2009 International SoC Design Conference, ISOCC 2009

Conference

Conference2009 International SoC Design Conference, ISOCC 2009
Country/TerritoryKorea, Republic of
CityBusan
Period22/11/0924/11/09

Keywords

  • Berlekamp-Massey algorithm
  • Component
  • Key equation solver
  • Pipelined
  • Reed-Solomon codes
  • Syndrome
  • VLSI

Fingerprint

Dive into the research topics of 'High-speed low-complexity Reed-Solomon decoder using pipelined Berlekamp-Massey algorithm'. Together they form a unique fingerprint.

Cite this