VLSI architectures for soft-decision decoding of Reed - Solomon codes

Arshad Ahmed, Ralf Koetter, Naresh R Shanbhag

Research output: Contribution to journalArticle

Abstract

Soft-decision decoding of Reed - Solomon codes delivers significant coding gains over classical minimum distance decoding. In this paper, we present architectures for polynomial interpolation and factorization, the two main steps of the soft-decoding algorithm. We introduce an algorithmic transformation for reducing the iterations required in generating the interpolation polynomial and present efficient architectures by sharing computations. We also describe algorithmic transformations for further reducing the interpolation and factorization latency. An area efficient, folded-pipelined version of the interpolation architecture is also described. Finally, we present an example of a Reed - Solomon soft decoder utilizing the presented architectures, having a 250 Mbps throughput.

Original languageEnglish (US)
Article number5695125
Pages (from-to)648-667
Number of pages20
JournalIEEE Transactions on Information Theory
Volume57
Issue number2
DOIs
StatePublished - Feb 1 2011

Keywords

  • BerlekampMassey algorithm
  • GuruswamiSudan algorithm
  • KoetterVardy algorithm
  • Reed - Solomon decoders
  • VLSI architectures
  • soft-decision decoding

ASJC Scopus subject areas

  • Information Systems
  • Computer Science Applications
  • Library and Information Sciences

Fingerprint Dive into the research topics of 'VLSI architectures for soft-decision decoding of Reed - Solomon codes'. Together they form a unique fingerprint.

  • Cite this