Decoding of Reed Solomon codes beyond the error-correction bound
Journal of Complexity
A displacement approach to efficient decoding of algebraic-geometric codes
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Fast factorization architecture in soft-decision Reed-Solomon decoding
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Improved decoding of Reed-Solomon and algebraic-geometry codes
IEEE Transactions on Information Theory
Algebraic soft-decision decoding of Reed-Solomon codes
IEEE Transactions on Information Theory
High-throughput interpolation architecture for algebraic soft-decision Reed-Solomon decoding
IEEE Transactions on Circuits and Systems Part I: Regular Papers
Backward interpolation architecture for algebraic soft-decision reed-solomon decoding
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Modified Low-Complexity Chase Soft-Decision Decoder of Reed---Solomon Codes
Journal of Signal Processing Systems
| Hi-index | 0.00 |
Reed-Solomon (RS) codes are one of the most widely utilized block error-correcting codes in modern communication and computer systems. Compared to hard-decision decoding, soft-decision decoding offers considerably higher error-correcting capability. The Koetter-Vardy (KV) soft-decision decoding algorithm can achieve substantial coding gain, while maintaining a complexity polynomial with respect to the code word length. In the KV algorithm, the interpolation step dominates the decoding complexity. A reduced complexity interpolation architecture is proposed in this paper by eliminating the polynomial updating corresponding to zero discrepancy coefficients in this step. Using this architecture, an area reduction of 27% can be achieved over prior efforts for the interpolation step of a typical (255, 239) RS code, while the interpolation latency remains the same.