Soft decision decoding of Reed-Solomon codes
- 16 December 2002
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 50 (11) , 1758-1768
- https://doi.org/10.1109/tcomm.2002.805279
Abstract
This paper presents a maximum-likelihood decoding (MLD) and a suboptimum decoding algorithm for Reed-Solomon (RS) codes. The proposed algorithms are based on the algebraic structure of the binary images of RS codes. Theoretical bounds on the performance are derived and shown to be consistent with simulation results. The proposed suboptimum algorithm achieves near-MLD performance with significantly lower decoding complexity. It is also shown that the proposed suboptimum, algorithm has better performance compared with generalized minimum distance decoding, while the proposed MLD algorithm has significantly lower decoding complexity than the well-known Vardy-Be'ery (1991) MLD algorithm.Keywords
This publication has 9 references indexed in Scilit:
- Improved decoding of Reed-Solomon and algebraic-geometry codesIEEE Transactions on Information Theory, 1999
- Bit-level soft-decision decoding of Reed-Solomon codesIEEE Transactions on Communications, 1991
- An improvement to generalized-minimum-distance decodingIEEE Transactions on Information Theory, 1991
- Minimal trellises for block codesIEEE Transactions on Information Theory, 1988
- Frequency-hop transmission for satellite packet switching and terrestrial packet radio networksIEEE Transactions on Information Theory, 1986
- Optimal soft decision block decoders based on fast Hadamard transformIEEE Transactions on Information Theory, 1986
- Efficient maximum likelihood decoding of linear block codes using a trellisIEEE Transactions on Information Theory, 1978
- Class of algorithms for decoding block codes with channel measurement informationIEEE Transactions on Information Theory, 1972
- Generalized minimum distance decodingIEEE Transactions on Information Theory, 1966