A Newton-Raphson method for moving-average spectral factorization using the Euclid algorithm
- 1 January 1990
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Acoustics, Speech, and Signal Processing
- Vol. 38 (10) , 1697-1709
- https://doi.org/10.1109/29.60101
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- The Euclid algorithm and the fast computation of cross-covariance and autocovariance sequencesIEEE Transactions on Acoustics, Speech, and Signal Processing, 1989
- Spectral Factorization by Optimal Gain IterationSIAM Journal on Applied Mathematics, 1983
- Generating covariance sequences and the calculation of quantization and rounding error variances in digital filtersIEEE Transactions on Acoustics, Speech, and Signal Processing, 1980
- Statistical design of autoregressive-moving average digital filtersIEEE Transactions on Acoustics, Speech, and Signal Processing, 1979
- Recursive algorithm for spectral factorizationIEEE Transactions on Circuits and Systems, 1974
- Algorithms for Triangular Decomposition of Block Hankel and Toeplitz Matrices with Application to Factoring Positive Matrix PolynomialsMathematics of Computation, 1973
- Numerical solution of linear equations with Toeplitz and Vector Toeplitz matricesNumerische Mathematik, 1969
- Factorization of the Covariance Generating Function of a Pure Moving Average ProcessSIAM Journal on Numerical Analysis, 1969
- Stability and Aperiodicity Constraints for System DesignIEEE Transactions on Circuit Theory, 1963
- EFFICIENT ESTIMATION OF PARAMETERS IN MOVING-AVERAGE MODELSBiometrika, 1959