Error control systems for digital communication and storage
Error control systems for digital communication and storage
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
Decoding of Reed Solomon codes beyond the error-correction bound
Journal of Complexity
Journal of Symbolic Computation - Special issue on applications of the Gröbner basis method
The Construction of Multivariate Polynomials with Preassigned Zeros
EUROCAM '82 Proceedings of the European Computer Algebra Conference on Computer Algebra
Bounded distance+1 soft-decision Reed-Solomon decoding
IEEE Transactions on Information Theory
Improved decoding of Reed-Solomon and algebraic-geometry codes
IEEE Transactions on Information Theory
Efficient decoding of Reed-Solomon codes beyond half the minimum distance
IEEE Transactions on Information Theory
Algebraic soft-decision decoding of Reed-Solomon codes
IEEE Transactions on Information Theory
Fast parallel algorithms for decoding Reed-Solomon codes based on remainder polynomials
IEEE Transactions on Information Theory
High-speed interpolation architecture for soft-decision decoding of Reed-Solomon codes
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Efficient Reed-Solomon Iterative Decoder Using Galois Field Instruction Set
SAMOS '08 Proceedings of the 8th international workshop on Embedded Computer Systems: Architectures, Modeling, and Simulation
A reconfigurable FEC system based on Reed-Solomon codec for DVB and 802.16 network
WSEAS Transactions on Circuits and Systems
IEEE Transactions on Information Theory
Hi-index | 0.06 |
The Koetter-Vardy algorithm is an algebraic soft-decision decoder for Reed-Solomon codes which is based on the Guruswami-Sudan list decoder. There are three main steps: (1) multiplicity calculation, (2) interpolation and (3) root finding. The Koetter-Vardy algorithm seems challenging to implement due to the high cost of interpolation. Motivated by a VLSI implementation viewpoint we propose an improvement to the interpolation algorithm that uses a transformation of the received word to reduce the number of iterations. We show how to reduce the memory requirements and give an efficient VLSI implementation for the Hasse derivative.