• DocumentCode
    239517
  • Title

    Spectral factorization of z-domain polynomials using non-linear least-squares

  • Author

    Moir, T.J.

  • Author_Institution
    Sch. of Eng., Auckland Univ. of Technol., Auckland, New Zealand
  • fYear
    2014
  • fDate
    20-23 Aug. 2014
  • Firstpage
    42
  • Lastpage
    47
  • Abstract
    A new recursive method for spectral factorizing polynomials is given. The method uses non-linear least-squares. The method is simple to implement and has applications in many areas of adaptive filtering, system identification and control. The optimization method is not new but to date has not been applied to spectral factorization. Convergence is much faster than ordinary root finding algorithms. (superlinear versus quadratic).
  • Keywords
    adaptive filters; least squares approximations; matrix decomposition; optimisation; polynomials; adaptive filtering; nonlinear least-squares; optimization method; recursive method; spectral factorizing polynomials; z-domain polynomials; Convergence; Cost function; Digital signal processing; Jacobian matrices; Polynomials; Signal processing algorithms; Vectors; non-linear least squares; spectral factorization; steepest descent;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Digital Signal Processing (DSP), 2014 19th International Conference on
  • Conference_Location
    Hong Kong
  • Type

    conf

  • DOI
    10.1109/ICDSP.2014.6900705
  • Filename
    6900705