DocumentCode :
877668
Title :
Simple algorithms for BCH decoding
Author :
Hong, Jonathan ; Vetterli, Martin
Author_Institution :
Dept. of Electr. Eng., Columbia Univ., New York, NY, USA
Volume :
43
Issue :
8
fYear :
1995
fDate :
8/1/1995 12:00:00 AM
Firstpage :
2324
Lastpage :
2333
Abstract :
Proposes some simple algorithms for decoding BCH codes. The authors show that the pruned FFT is an effective method for evaluating syndromes and for finding the roots of error-locator polynomials. They show that a simple variation of the basic Gaussian elimination procedure can be adapted to compute the error-locator polynomial efficiently for codes with small designed distance. Finally, they give a procedure for computing the error values that has half the complexity of the Forney algorithm
Keywords :
BCH codes; cyclic codes; decoding; error analysis; fast Fourier transforms; polynomials; BCH decoding; Forney algorithm; Gaussian elimination procedure; algorithms; error values; error-locator polynomials; pruned FFT; syndromes; Application software; Codes; Communications Society; Computer errors; Decoding; Equations; Nonlinear filters; Polynomials; Power generation; Senior members;
fLanguage :
English
Journal_Title :
Communications, IEEE Transactions on
Publisher :
ieee
ISSN :
0090-6778
Type :
jour
DOI :
10.1109/26.403765
Filename :
403765
Link To Document :
بازگشت