DocumentCode
3178171
Title
Adaptive Reed-Solomon decoding using Gao´s algorithm
Author
Komo, John J. ; Joiner, Laurie L.
Author_Institution
Dept. of Electr. & Comput. Eng., Clemson Univ., SC, USA
Volume
2
fYear
2002
fDate
7-10 Oct. 2002
Firstpage
1340
Abstract
Gao´s algorithm for decoding Reed-Solomon codes is considered here. This algorithm is a new algorithm that computes the message polynomial estimate directly without explicitly finding error locations or error magnitudes. A generalized-minimum-distance (GMD) decoding procedure is used in conjunction with Gao´s algorithm for efficiently decoding Reed-Solomon codes. It is shown here that the decoder polynomial only has to be slightly modified as the number of erasures is increased for each step of the generalized-minimum-distance decoding.
Keywords
Reed-Solomon codes; adaptive codes; decoding; military communication; polynomials; GMD decoding; Gao algorithm; Reed-Solomon codes; adaptive Reed-Solomon decoding; decoder polynomial; erasures; generalized-minimum-distance decoding; message polynomial estimate; military communication; Decoding; Encoding; Equations; Fourier transforms; Geometry; Interpolation; Polynomials; Reed-Solomon codes; Research initiatives; Shift registers;
fLanguage
English
Publisher
ieee
Conference_Titel
MILCOM 2002. Proceedings
Print_ISBN
0-7803-7625-0
Type
conf
DOI
10.1109/MILCOM.2002.1179675
Filename
1179675
Link To Document