Title :
Fast inversion of Hankel systems and efficient BCH decoding
Author :
Schmidt, Michael ; Fettweis, Gerhard P.
Author_Institution :
Endowed Chair for Mobile Commun. Syst., Tech. Univ. Dresden, Germany
fDate :
29 Jun-4 Jul 1997
Abstract :
BCH decoding usually involves the evaluation of the error-locator polynomial. This is often achieved with the Berlekamp-Massey algorithm. The evaluation of the error-locator polynomial may also be computed using fast inversion techniques for Hankel matrices. It can be shown that O(lt) steps are necessary, with l being the number of errors which occurred and t being the error-correction capability of the BCH code
Keywords :
BCH codes; Hankel matrices; decoding; error correction codes; matrix inversion; polynomial matrices; Berlekamp-Massey algorithm; Hankel matrices; Hankel systems; efficient BCH decoding; error-correction capability; error-locator polynomial; fast inversion; fast inversion techniques; Decoding; Equations; Error correction; Filtering theory; Filters; Polynomials; Reed-Solomon codes; Signal processing algorithms; Testing;
Conference_Titel :
Information Theory. 1997. Proceedings., 1997 IEEE International Symposium on
Conference_Location :
Ulm
Print_ISBN :
0-7803-3956-8
DOI :
10.1109/ISIT.1997.613253
