论文信息 - A divisionless form of the Schur Berlekamp-Massey algorithm

A divisionless form of the Schur Berlekamp-Massey algorithm

A procedure exists for mapping the Berlekamp-Massey algorithm (BMA) into so-called Schur form. This procedure will be shown here to be applicable to the development of a divisionless Schur BMA. When the BMA is combined with the Schur BMA the result is an efficient parallel algorithm for the computation of the error-locator polynomial which is used in the decoding of Reed-Solomon, or, more generally, Bose-Chaudhuri-Hocquenghem codes.

Christopher J. Zarowski | C. Zarowski

[1] R. Blahut. Theory and practice of error control codes , 1983 .

[2] Sun-Yuan Kung,et al. A highly concurrent algorithm and pipeleined architecture for solving Toeplitz systems , 1983 .

[3] Richard E. Blahut,et al. A Universal Reed-Solomon Decoder , 1984, IBM J. Res. Dev..

[4] Irving S. Reed,et al. On the VLSI Design of a Pipeline Reed-Solomon Decoder Using Systolic Arrays , 1988, IEEE Trans. Computers.

[5] Tho Le-Ngoc,et al. A Versatile Time-Domain Reed-Solomon Decoder , 1990, IEEE J. Sel. Areas Commun..

[6] X. Youzhi. Implementation of Berlekamp-Massey algorithm without inversion , 1991 .

[7] Christopher J. Zarowski,et al. Schur algorithms for Hermitian Toeplitz, and Hankel matrices with singular leading principal submatrices , 1991, IEEE Trans. Signal Process..

[8] Pierre Duhamel,et al. On the methods for solving Yule-Walker equations , 1992, IEEE Trans. Signal Process..