An algorithm for solving discrete-time Wiener-Hopf equations based upon Euclid's algorithm
- 1 May 1986
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 32 (3) , 394-409
- https://doi.org/10.1109/tit.1986.1057178
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Fast solution of toeplitz systems of equations and computation of Padé approximantsPublished by Elsevier ,2004
- A generalization of the Levinson algorithm for Hermitian Toeplitz matrices with any rank profileIEEE Transactions on Acoustics, Speech, and Signal Processing, 1985
- Fast algorithms for rational Hermite approximation and solution of Toeplitz systemsIEEE Transactions on Circuits and Systems, 1979
- A Property of Euclid’s Algorithm and an Application to Padé ApproximationSIAM Journal on Applied Mathematics, 1978
- On the complexity of decoding Goppa codes (Corresp.)IEEE Transactions on Information Theory, 1977
- Algorithms for Triangular Decomposition of Block Hankel and Toeplitz Matrices with Application to Factoring Positive Matrix PolynomialsMathematics of Computation, 1973
- Shift-register synthesis and BCH decodingIEEE Transactions on Information Theory, 1969
- An Algorithm for the Inversion of Finite Toeplitz MatricesJournal of the Society for Industrial and Applied Mathematics, 1964
- The Fitting of Time-Series ModelsRevue de l'Institut International de Statistique / Review of the International Statistical Institute, 1960
- The Wiener (Root Mean Square) Error Criterion in Filter Design and PredictionJournal of Mathematics and Physics, 1946