DocumentCode :
2484750
Title :
Maximum likelihood decoding of Reed Solomon codes
Author :
Ponnampalam, Vishakan ; Vucetic, Branka
Author_Institution :
Dept. of Electr. Eng., Sydney Univ., NSW, Australia
fYear :
1998
fDate :
16-21 Aug 1998
Firstpage :
368
Abstract :
This paper presents a bit level soft decision decoding algorithm for Reed-Solomon codes of moderately low complexity. Coset properties of Reed-Solomon codes represented in GF(2) are used to derive an efficient maximum likelihood decoding algorithm. The algorithm could be easily modified to produce soft output estimates
Keywords :
Galois fields; Reed-Solomon codes; computational complexity; maximum likelihood decoding; AWGN channel; BPSK signalling; Galois field; Reed Solomon codes; SNR; bit level soft decision decoding algorithm; coset properties; low complexity code; maximum likelihood decoding algorithm; soft output estimates; AWGN channels; Binary phase shift keying; Computational complexity; Equations; Error correction codes; Interleaved codes; Maximum likelihood decoding; Reed-Solomon codes; Signal to noise ratio; Viterbi algorithm;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Theory, 1998. Proceedings. 1998 IEEE International Symposium on
Conference_Location :
Cambridge, MA
Print_ISBN :
0-7803-5000-6
Type :
conf
DOI :
10.1109/ISIT.1998.708973
Filename :
708973
Link To Document :
بازگشت