High-speed architectures for Reed-Solomon decoders
Top Cited Papers
- 1 October 2001
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Very Large Scale Integration (VLSI) Systems
- Vol. 9 (5) , 641-655
- https://doi.org/10.1109/92.953498
Abstract
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+[log/sub 2/,(t+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.Keywords
This publication has 13 references indexed in Scilit:
- Systolic architectures for decoding Reed-Solomon codesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A 40-MHz encoder-decoder chip generated by a Reed-Solomon code compilerPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- New serial architecture for the Berlekamp-Massey algorithmIEEE Transactions on Communications, 1999
- A new scalable VLSI architecture for Reed-Solomon decodersIEEE Journal of Solid-State Circuits, 1999
- Reed-Solomon VLSI codec for advanced televisionIEEE Transactions on Circuits and Systems for Video Technology, 1991
- VLSI design of inverse-free Berlekamp—Massey algorithmIEE Proceedings E Computers and Digital Techniques, 1991
- Pipeline interleaving and parallelism in recursive digital filters. I. Pipelining using scattered look-ahead and decompositionIEEE Transactions on Acoustics, Speech, and Signal Processing, 1989
- A VLSI Design of a Pipeline Reed-Solomon DecoderIEEE Transactions on Computers, 1985
- Inversionless decoding of binary BCH codesIEEE Transactions on Information Theory, 1971
- Shift-register synthesis and BCH decodingIEEE Transactions on Information Theory, 1969