1999
DOI: 10.1109/4.748191
|View full text |Cite
|
Sign up to set email alerts
|

A new scalable VLSI architecture for Reed-Solomon decoders

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
5
0

Year Published

1999
1999
2024
2024

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 52 publications
(5 citation statements)
references
References 13 publications
0
5
0
Order By: Relevance
“…Calculation of the Error Locator Polynomial using an algorithm 3. Chien Search Algorithm for locating and correcting errors Currently, the Berlekamp-Massey (BM) algorithm and the Euclidean algorithm are the main computational methods [16][17][18] for decoding long BCH codes. The Euclidean algorithm requires a larger computational load.…”
Section: Cbch Codementioning
confidence: 99%
“…Calculation of the Error Locator Polynomial using an algorithm 3. Chien Search Algorithm for locating and correcting errors Currently, the Berlekamp-Massey (BM) algorithm and the Euclidean algorithm are the main computational methods [16][17][18] for decoding long BCH codes. The Euclidean algorithm requires a larger computational load.…”
Section: Cbch Codementioning
confidence: 99%
“…Traditional RS coder/decoders are shift registersbased sequential circuits [6,7] . After certain shift latency, RS coders are clocked out in a consecutive order.…”
Section: Parallel Reed-solomon Eccmentioning
confidence: 99%
“…In the first stage of h(s) calculation, the 2,3,4 and 5 dimensional determinants are calculated. In the second stage, the are selected according to e and the coefficients of E r ( e ) (2) are computed. Table 1 shows the FPGA synthesis result of each stage of the pipelined core circuit with a commercial FPGA (Xilinx Virtex-I1 Pro).…”
Section: Core Architecturementioning
confidence: 99%
“…See, for example, [2] and references therein. These decoders, however, cannot achieve 40 Gbps data rate as a single decoder because of their direct implementation of conventional sequential algorithms with conditional branches, such as BerlekampMassey or (extended) Euclid algorithms.…”
Section: Introductionmentioning
confidence: 98%