Encounters with the Berlekamp-Massey Algorithm
暂无分享,去创建一个
[1] R. Blahut,et al. Algebraic fields, signal processing, and error control , 1985, Proceedings of the IEEE.
[2] T. Kailath,et al. On a generalized Szegö- Levinson realization algorithm for optimal linear predictors based on a network synthesis approach , 1978 .
[3] Elwyn R. Berlekamp,et al. Algebraic coding theory , 1984, McGraw-Hill series in systems science.
[4] James L. Massey,et al. Shift-register synthesis and BCH decoding , 1969, IEEE Trans. Inf. Theory.
[5] Thomas Kailath,et al. Linear Systems , 1980 .
[6] C. Lanczos. Solution of Systems of Linear Equations by Minimized Iterations1 , 1952 .
[7] Thomas Kailath,et al. An inverse scattering approach to the partial realization problem , 1984, The 23rd IEEE Conference on Decision and Control.
[8] N. Levinson. The Wiener (Root Mean Square) Error Criterion in Filter Design and Prediction , 1946 .
[9] Alfred M. Bruckstein,et al. Inverse scattering for discrete transmission—line models , 1987 .
[10] Jack K. Wolf,et al. Redundancy, the Discrete Fourier Transform, and Impulse Noise Cancellation , 1983, IEEE Trans. Commun..
[11] S. Kung. Multivariable and multidimensional systems: Analysis and design , 1977 .
[12] Alston S. Householder,et al. The Theory of Matrices in Numerical Analysis , 1964 .
[13] J. Schur,et al. Über Potenzreihen, die im Innern des Einheitskreises beschränkt sind. , 1917 .
[14] T. Kailath,et al. An inverse scattering framework for several problems in signal processing , 1987, IEEE ASSP Magazine.
[15] Robert A. Scholtz,et al. Continued fractions and Berlekamp's algorithm , 1979, IEEE Trans. Inf. Theory.
[16] J. L. Hock,et al. An exact recursion for the composite nearest‐neighbor degeneracy for a 2×N lattice space , 1984 .
[17] Masao Kasahara,et al. A Method for Solving Key Equation for Decoding Goppa Codes , 1975, Inf. Control..
[18] M. Morf. Fast Algorithms for Multivariable Systems , 1974 .
[19] W. W. Peterson,et al. Encoding and error-correction procedures for the Bose-Chaudhuri codes , 1960, IRE Trans. Inf. Theory.
[20] B. Parlett. The Symmetric Eigenvalue Problem , 1981 .
[21] Beresford N. Parlett,et al. Reduction to Tridiagonal Form and Minimal Realizations , 1992, SIAM J. Matrix Anal. Appl..
[22] Thomas Kailath,et al. Fast Triangular Factorization and Inversion of Hermitian, Toeplitz, and Related Matrices with Arbitrary Rank Profile , 1993, SIAM J. Matrix Anal. Appl..
[23] Alfred M. Bruckstein,et al. Inverse scattering and minimal partial realizations , 1988 .
[24] J. Rissanen. Recursive identification of linear systems , 1971 .
[25] Thomas Kailath,et al. Regular iterative algorithms and their implementation on processor arrays , 1988, Proc. IEEE.
[26] Arne Magnus,et al. Certain continued fractions associated with the Padé table , 1962 .
[27] Rene F. Swarttouw,et al. Orthogonal polynomials , 2020, NIST Handbook of Mathematical Functions.
[28] Jorma Rissanen,et al. Solution of linear equations with Hankel and Toeplitz matrices , 1974 .
[29] T. Kailath,et al. Array architectures for iterative algorithms , 1987, Proceedings of the IEEE.
[30] T. Kailath,et al. Fast Estimation of Principal Eigenspace Using LanczosAlgorithm , 1994 .
[31] Thomas Kailath,et al. Divide-and-conquer solutions of least-squares problems for matrices with displacement structure , 1991 .
[32] Unjeng Cheng. On the continued fraction and Berlekamp's algorithm , 1984, IEEE Trans. Inf. Theory.
[33] W. Gragg,et al. On the partial realization problem , 1983 .
[34] B. Dickinson,et al. A minimal realization algorithm for matrix sequences , 1973, CDC 1973.