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 language | English (US) |
---|---|
Article number | 5695125 |
Pages (from-to) | 648-667 |
Number of pages | 20 |
Journal | IEEE Transactions on Information Theory |
Volume | 57 |
Issue number | 2 |
DOIs | |
State | Published - Feb 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