A new VLSI design for decoding of Reed-Solomon codes based on ASIP [HDTV]

Xu, Yuanxin; Xia, Fang; Yao, Qingdong; Qiu, Peiliang; Wang, Kuang

doi:10.1109/icasic.2001.982597

Cited by 2 publications

(4 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Hence, the ME algorithm must perform the degree comparisons and degree computations. In other words, the existing ME architectures [12][13][14][15][16][17] can achieve either high performance or low complexity, but not both. Figure 3 presents the flowchart of the ME algorithm [11], which obviously shows the degree computations and degree comparisons.…”

Section: Modified Euclid's Algorithmmentioning

confidence: 99%

“…The hardware complexity of the key equation solver blocks [12][13][14][15][16][17], based on the ME algorithm, can be decided by the highest degree of the initial conditions, since the highest degree shows the number of the coefficients computed to obtain the error evaluator and error locator polynomials. As shown in the above initial conditions, the highest degree is 2t, and thus, the key equation solver blocks [12][13][14][15][16][17], based on the ME algorithm, have the same computational complexity regardless of their architectures. The ME algorithm performs the computations of the following equations…”

Section: Modified Euclid's Algorithmmentioning

confidence: 99%

“…Instead, hardware implementations of the various key equation solver blocks [12][13][14][15][16][17][18] using the ME algorithm have been intensively investigated, without any modification of the ME algorithm itself and, in this respect the authors have previously proposed the degree computationless modified Euclid's (DCME) algorithm [19] to improve the ME algorithm. However, even though the DCME architecture [19], and the pipelined DCME (pDCME) architecture [20], show smaller areas and shorter critical path delays than the existing ME architectures, they still require a larger area and longer critical path delay compared with the RiBM architecture in [10].…”

mentioning

confidence: 99%

“…To remove these inversions, the modified Euclid's (ME) algorithm for solving the key equation was proposed in 1985 [11]. Since the ME algorithm can achieve the regularity and the same critical path delay regardless of the error correction capability t despite its high hardware complexity, various ME architectures [12][13][14][15][16][17][18] have been proposed.…”

mentioning

confidence: 99%

See 3 more Smart Citations

New Cost-Effective Simplified Euclid’s Algorithm for Reed-Solomon Decoders

Baek

Sunwoo

2012

J Sign Process Syst

View full text Add to dashboard Cite

This paper proposes a cost-effective simplified Euclid's (SE) algorithm for Reed-Solomon decoders, which can replace the existing modified Euclid's (ME) algorithm. The new proposed SE algorithm, using new initial conditions and polynomials, can significantly reduce the computation complexity compared with the existing ME and reformulated inversionless Berlekamp-Massey (RiBM) algorithms, since it has the least number of coefficients in the new initial conditions. Thus, the proposed SE architecture, consisting of only 3t basic cells, has the smallest area among the existing key solver blocks, where t means the error correction capability. In addition, the SE architecture requires only the latency of 2t clock cycles to solve the key equation without initial latency. The proposed RS decoder has been synthesized using the 0.18 μm Samsung cell library, and the gate count of the RS decoder, excluding FIFO memory, is only 40,136 for the (255, 239, 8) RS code.

show abstract