Ultra Folded High-Speed Architectures for Reed-Solomon Decoders

Authors:
Kavish Seth;K. N. Viswajith;S. Srinivasan;V. Kamakoti
Affiliations:
Atheros India LLC.;TCS;Indian Institute of Technology - Madras;Indian Institute of Technology - Madras
Venue:
VLSID '06 Proceedings of the 19th International Conference on VLSI Design held jointly with 5th International Conference on Embedded Systems Design
Year:
2006

Citing 0
Cited 4

Area-efficient Reed-Solomon decoder design for optical communications

IEEE Transactions on Circuits and Systems II: Express Briefs
VLSI implementation of BCH error correction for multilevel cell NAND flash memory

IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Efficient Generalized Minimum-distance Decoders of Reed-Solomon Codes

Journal of Signal Processing Systems
Nonlinear multi-error correction codes for reliable MLC NAND flash memories

IEEE Transactions on Very Large Scale Integration (VLSI) Systems

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this paper, a new high-speed VLSI architecture for decoding Reed-Solomon codes with the Berlekamp-Masseyalgorithm is presented. The proposed scheme uses the fully folded systolic architecture in which a single array of processors, computes both the error-locator and the error-evaluator polynomials. The proposed scheme utilizes the folding property of systolic array architectures and reduces the number of multipliers and adders drastically at the expense of some compromise in the speed. More interestingly, the proposed architecture requires approximately 60% fewer multipliers and a simpler control structure than the popular RiBM architecture. The reduction in the number of multipliers and adders in the proposed architecture leads to smaller silicon area and lower power consumption.