Soft decision decoding of Reed Solomon codes

Author

Ponnampalam, Vishakan ; Vucetic, Branka

Author_Institution

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

fYear

2000

fDate

2000

Firstpage

62

Abstract

The paper presents a maximum likelihood decoding (MLD) and a sub-optimum decoding algorithm for Reed-Solomon codes. The proposed algorithms are based on the algebraic structure of RS codes represented in GF(2). Theoretical bounds on the performance are derived and shown to be accurate. The proposed sub-optimum algorithm is seen to have better error performance compared to other sub-optimum decoding algorithms while the new MLD algorithm has significantly lower decoding complexity when compared to other MLD algorithms

Keywords

Galois fields; Reed-Solomon codes; algebraic codes; block codes; computational complexity; error correction codes; maximum likelihood decoding; polynomials; GF(2); Reed Solomon codes; algebraic structure; decoding complexity; error performance; maximum likelihood decoding; performance bounds; soft decision decoding; sub-optimum decoding algorithm; Australia; Bit error rate; Block codes; Computational complexity; Decoding; Error correction; Gain; Partitioning algorithms; Reed-Solomon codes; Signal to noise ratio;

fLanguage

English

Publisher

ieee

Conference_Titel

Information Theory, 2000. Proceedings. IEEE International Symposium on

Conference_Location

Sorrento

Print_ISBN

0-7803-5857-0

Type

conf

DOI

10.1109/ISIT.2000.866352

Filename

866352