Universal Reed-Solomon decoders based on the Berlekamp-Massey algorithm

Authors:
Zhiyuan Yan;Dilip V. Sarwate
Affiliations:
Lehigh University, Bethlehem, PA;University of Illinois at Urbana-Champaign, Urbana, IL
Venue:
Proceedings of the 14th ACM Great Lakes symposium on VLSI
Year:
2004

Citing 5
Cited 0

A Cellular Structure for a Versatile Reed-Solomon Decoder

IEEE Transactions on Computers
High-speed architectures for Reed-Solomon decoders

IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Reed-Solomon Codes and Their Applications

Reed-Solomon Codes and Their Applications
VLSI Algorithms, Architectures, and Implementation of a Versatile GF(2m) Processor

IEEE Transactions on Computers
Capacity of fading channels with channel side information

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

Universal Reed-Solomon decoders allow flexibility in some or all of the code parameters,and hence lend themselves to applications wherein adaptability and reconfigurability are important considerations. In this paper,we consider universal finite field arithmetics using either canonical polynomial basis or shifted polynomial basis, and propose a high-speed universal Reed-Solomon decoder by modifying the high-speed decoder proposed in [10 ].