DocumentCode :
346530
Title :
Sub-optimum decoding of Reed-Solomon codes
Author :
Ponnampalam, Vishakan ; Vucetic, Branka
Author_Institution :
Sch. of Electr. & Inf. Eng., Sydney Univ., NSW, Australia
Volume :
3
fYear :
1999
fDate :
1999
Firstpage :
1625
Abstract :
This paper presents a sub-optimum soft decision decoding (SDD) algorithm for Reed Solomon (RS) codes. The sub-optimum algorithm is based on a maximum likelihood (ML) algorithm. The performance of the decoding algorithm and its complexity are obtained by computer simulations and compared to some well known decoding schemes. It is shown that the proposed algorithm achieves near-ML performance with significantly lower decoding complexity
Keywords :
Reed-Solomon codes; computational complexity; error correction codes; maximum likelihood decoding; Reed-Solomon codes; complexity; computer simulations; decoding algorithm; maximum likelihood algorithm; soft decision decoding; sub-optimum decoding; Australia; Computer simulation; Equations; Error correction codes; Interleaved codes; Maximum likelihood decoding; Reed-Solomon codes;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Vehicular Technology Conference, 1999. VTC 1999 - Fall. IEEE VTS 50th
Conference_Location :
Amsterdam
ISSN :
1090-3038
Print_ISBN :
0-7803-5435-4
Type :
conf
DOI :
10.1109/VETECF.1999.801572
Filename :
801572
Link To Document :
بازگشت