High-Speed Architectures for Reed–Solomon

shaweikang1984

New high-speed VLSI architectures for decoding
Reed–Solomon codes with the Berlekamp–Massey algorithm
are presented in this paper. The speed bottleneck in the
Berlekamp–Massey algorithm is in the iterative computation of
discrepancies followed by the updating of the error-locator polynomial.
This bottleneck is eliminated via a series of algorithmic
transformations that result in a fully systolic architecture in which
a single array of processors computes both the error-locator
and the error-evaluator polynomials. In contrast to conventional
Berlekamp–Massey architectures in which the critical path passes
through two multipliers and 1 + log2( + 1) adders, the
critical path in the proposed architecture passes through only one
multiplier and one adder, which is comparable to the critical path
in architectures based on the extended Euclidean algorithm. More
interestingly, the proposed architecture requires approximately
25% fewer multipliers and a simpler control structure than the
architectures based on the popular extended Euclidean algorithm.
For block-interleaved Reed–Solomon codes, embedding the
interleaver memory into the decoder results in a further reduction
of the critical path delay to just one XOR gate and one multiplexer,
leading to speed ups of as much as an order of magnitude over
conventional architectures.





High-Speed Architectures for Reed–Solomon.pdf (381.19 KB , 下载次数: 102 )

2011-1-6 22:08 上传

点击文件名下载附件

Jason.tschen

OK , I am interested to ECC any  topics
BUT I am not sure it is a paper or Ebook ??

OK , after posted something , it is just paper only

呼噜娃

kankan

Daniel10003

呵呵，谢谢楼主

A1985

......看看。。。。。。。。。。。。。

shenguangyang

回复 1# shaweikang1984


    ggggggggggggggggg

zh123456789

谢谢啊

ryan80

Thanks!!!!

pupukid

dddddddddddddd

shemeets

好东西  看看