Name
Title | ||
|---|---|---|
Direct Root Computation Architecture for Algebraic Soft-Decision Decoding of Reed-Solomon Codes |
Abstract | ||
|---|---|---|
Algebraic soft-decision decoding (Koetter and Vardy, 2003) is a recent breakthrough in decoding of Reed-Solomon codes and it achieves significant decoding gain over conventional hard-decision decoding. In the bivariate polynomial factorization step of the new decoding algorithm, solving polynomial equations is required and it may contribute to a significant portion of the overall decoding latency. This paper presents a low-latency direct root computation architecture, which should lead to a factorization architecture that is of lower latency and more area efficient |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1109/ISCAS.2007.378492 | ISCAS |
Keywords | Field | DocType |
logic circuits,factorization architecture,codecs,reed-solomon codes,direct root computation architecture,coprocessors,polynomials,low-latency direct root computation,algebraic soft decision decoding,galois fields,polynomial factorization,computer architecture,reed solomon code,low latency,interpolation | Finite field,Sequential decoding,Berlekamp–Welch algorithm,Polynomial,Computer science,Arithmetic,Theoretical computer science,Electronic engineering,Reed–Solomon error correction,Decoding methods,List decoding,Codec | Conference |
ISSN | ISBN | Citations |
0271-4302 | 1-4244-0921-7 | 1 |
PageRank | References | Authors |
0.39 | 3 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jun Ma | 1 | 93 | 9.42 |
| Alexander Vardy | 2 | 2736 | 272.53 |
| Zhongfeng Wang | 3 | 241 | 19.02 |
| Qinqin Chen | 4 | 10 | 3.11 |