Abstract
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.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
C. J. Zarowski, ”Schur Algorithms for Hermitian Toeplitz, and Hankel Matrices with Singular Leading Principal Submatrices,” IEEE Trans. on Signal Proc., vol. 39, Nov. 1991, pp. 2464–2480.
H.-M. Zhang, P. Duhamel, ”On the Methods for Solving Yule-Walker Equations,” IEEE Trans. on Signal Proc., vol. 40, Dec. 1992, pp. 2987–3000.
S.-Y. Kung, Y. H. Hu, ”A Highly Concurrent Algorithm and Pipelined Architecture for Solving Toeplitz Systems,” IEEE Trans. on Acoust., Speech, and Signal Proc., vol. ASSP-31, Feb. 1983, pp. 66–75.
C. J. Zarowski, ”Parallel Implementation of the Schur Berlekamp-Massey Algorithm on a Linearly Connected Processor Array,” to appear in the IEEE Transactions on Computers (accepted September 1993).
X. Youzhi, ”Implementation of Berlekamp-Massey Algorithm Without Inversion,” IEE Proc.-I, vol. 138, June 1991, pp. 138–140.
R. Blahut, Theory and Practice of Error Control Codes. Reading, Massachusetts: Addison-Wesley, 1983.
T. Citron, ”Algorithms and Architectures for Error Correcting Codes,” Ph. D. dissertation, Stanford University, 1986.
R. Blahut, ”A Universal Reed-Solomon Decoder,” IBM J. Res. Dev., vol. 28, Mar. 1984, pp. 150–158.
Y. Shayan, T. Le-Ngoc, V. Bhargava, ”A Versatile Time-Domain Reed-Solomon Decoder,” IEEE J. on Sel. Areas in Comm., vol. 8, Oct. 1990, pp. 1535–1542.
H. M. Shao, I. S. Reed, ”On the VLSI Design of a Pipeline Reed-Solomon Decoder Using Systolic Arrays,” IEEE Trans. on Comp., vol. 37, Oct. 1988, pp. 1273–1280.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zarowski, C.J. (1994). A divisionless form of the Schur Berlekamp-Massey algorithm. In: Gulliver, T.A., Secord, N.P. (eds) Information Theory and Applications. ITA 1993. Lecture Notes in Computer Science, vol 793. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57936-2_29
Download citation
DOI: https://doi.org/10.1007/3-540-57936-2_29
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57936-6
Online ISBN: 978-3-540-48392-2
eBook Packages: Springer Book Archive