Universal Reed-Solomon decoders based on the Berlekamp-Massey algorithm
Zhiyuan Yan, D.V. Sarwate · 2004
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 ].