Abstract
Spectral pole-zero models are used as a method of reducing the number of parameters needed to represent certain classes of spectra, e.g., spectral envelopes having deep valleys. We present here an iterative algorithm for Autoregressive-Moving Average (ARMA) models that is based on a repeated use of Levinson's algorithm to obtain both poles and zeros. The procedure allows one to increase the number of poles and zeros iteretively, similar to linear prediction methods. Empirical results indicate that a slow growth of the orders of the denominator and numerator polynomials usually produces better ARMA models.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
