Berlekamp—Massey Algorithm, Continued Fractions, Pade Approximations, and Orthogonal Polynomials
- 80 Downloads
The Berlekamp—Massey algorithm (further, the BMA) is interpreted as an algorithm for constructing Pade approximations to the Laurent series over an arbitrary field with singularity at infinity. It is shown that the BMA is an iterative procedure for constructing the sequence of polynomials orthogonal to the corresponding space of polynomials with respect to the inner product determined by the given series. The BMA is used to expand the exponential in continued fractions and calculate its Pade approximations.
Key wordsBerlekamp—Massey algorithm Pade approximations continued fraction orthogonal polynomial Laurent series Euclid's algorithm
Unable to display preview. Download preview PDF.
- 1.D. Jungnickel, Finite Fields: Structure and Arithmetic, Wissenschaftsverlag, Mannheim-Leipzig-Wien, 1993.Google Scholar
- 2.R. Blahut, Theory and Practice of Error Control Codes, Addison-Wesley, Reading, MA, 1983; Russian translation: Mir, Moscow, 1986.Google Scholar
- 4.E. R. Berlekamp, Algebraic Coding Theory, McGraw-Hill, New York, 1968; Russian translation: Mir, Moscow, 1972.Google Scholar
- 8.U. Cheng, “On the continued fractions and Berlekamp's algorithm,” IEEE Trans. Inform. Theory, IT-30 (1984), no. 3, 541–544.Google Scholar
- 10.Zongduo Dai and Kencheng Zeng, “Continued fractions and Berlekamp—Massey algorithm,” in: Advances in Cryptology—Auscript-90, Springer-Verlag, Berlin, 1990, pp. 24–31.Google Scholar
- 11.E. M. Nikishin and V. N. Sorokin, Rational Approximations and Orthogonality [in Russian] Nauka, Moscow, 1988.Google Scholar
- 12.G. Szego, Orthogonal Polynomials, Colloquium Publ., vol. XXIII, Amer. Math. Soc., Providence, RI, 1959; Russian translation, Fizmatgiz, Moscow, 1962.Google Scholar
- 14.R. L. Graham, D. E. Knuth, and O. Patashnik, Concrete Mathematics, Addison-Wesley, Reading, MA, 1994; Russian translation: Mir, Moscow, 1998.Google Scholar