Title :
On the efficient decoding of Reed-Solomon codes based on GMD criterion
Author :
Araki, Kiyomichi ; Takada, Masayuki ; Morii, Masakatu
Author_Institution :
Dept. of Electron. Eng., Saitama Univ., Urawa, Japan
Abstract :
An efficient algorithm for GMD (generalized minimum distance) decoding is presented. It requires an algebraic errors-and-erasures decoding procedure to execute only one time. The Welch-Berlekamp iterative method is efficiently used to reduce the number of algebraic decoding procedures. A method for hardware implementation of this GMD decoding is shown
Keywords :
Reed-Solomon codes; decoding; iterative methods; GMD criterion; Reed-Solomon codes; Welch-Berlekamp iterative method; algebraic errors-and-erasures decoding; decoding; generalized minimum distance; hardware implementation; Computer science; Equations; Error correction codes; Hardware; Iterative algorithms; Iterative decoding; Iterative methods; Maximum likelihood decoding; Polynomials; Reed-Solomon codes;
Conference_Titel :
Multiple-Valued Logic, 1992. Proceedings., Twenty-Second International Symposium on
Conference_Location :
Sendai
Print_ISBN :
0-8186-2680-1
DOI :
10.1109/ISMVL.1992.186788
