Soft decision decoding of Reed-Solomon codes

Author

Ponnampalam, Vishakan ; Vucetic, Branka

Author_Institution

Sch. of Electr. & Inf. Eng., Sydney Univ., NSW, Australia

Volume

50

Issue

11

fYear

2002

fDate

11/1/2002 12:00:00 AM

Firstpage

1758

Lastpage

1768

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

Reed-Solomon codes; computational complexity; maximum likelihood decoding; AWGN channel; RS codes; Reed-Solomon codes; Vardy-Be´ery MLD algorithm; algebraic structure; binary images; decoding complexity; generalized minimum distance decoding; maximum likelihood decoding; minimum Hamming distance; near-MLD performance; simulation results; soft decision decoding; suboptimum algorithm; suboptimun decoding algorithm; CD recording; Communication systems; Computational complexity; Error correction; Helium; Information theory; Interpolation; Maximum likelihood decoding; Partitioning algorithms; Reed-Solomon codes;

fLanguage

English

Journal_Title

Communications, IEEE Transactions on

Publisher

ieee

ISSN

0090-6778

Type

jour

DOI

10.1109/TCOMM.2002.805279

Filename

1097886