Error control systems for digital communication and storage
Error control systems for digital communication and storage
A Design of Reed-Solomon Decoder with Systolic-Array Structure
IEEE Transactions on Computers
High-speed architectures for Reed-Solomon decoders
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
An area-efficient VLSI architecture of a Reed-Solomon decoder/encoder for digital VCRs
IEEE Transactions on Consumer Electronics
Recoverability study of SPC product codes under erasure decoding
Information Sciences—Informatics and Computer Science: An International Journal
Recoverability study of SPC product codes under erasure decoding
Information Sciences: an International Journal
Hi-index | 0.07 |
A modified Euclidean decoding algorithm to solve the Berlekamp's key equation of Reed-Solomon code for correcting errors, is presented in this paper. It is derived to solve the error locator and evaluator polynomials simultaneously without performing the operations of polynomial division and field element inversion. In this algorithm, the number of iterations used to solve the equation is fixed, and also the weights used to reduce the degree of the error evaluator polynomial at each iteration can be extracted from the coefficient of fixed degree. Therefore, this proposed algorithm saves many controlling circuits, and provides module architecture with regularity. As a result it is simple and easy to implement, and in addition it can be easily configured for various applications.