• DocumentCode
    2085269
  • Title

    New stable IIR modeling of long FIR filters with low complexity

  • Author

    Chen, Jie ; Parhi, Keshab K.

  • Author_Institution
    Dept. of Electr. & Comput. Eng., Univ. of Minnesota, Minneapolis, MN
  • fYear
    2008
  • fDate
    26-29 Oct. 2008
  • Firstpage
    1649
  • Lastpage
    1653
  • Abstract
    This paper presents a new efficient method for stable pole-zero modeling of long finite impulse response (FIR) filters. The proposed method is based on the formulation of a generalized system identification problem using the minimum mean-square error (MMSE) criterion. A computationally efficient MMSE solution is then derived by exploiting the structured matrices. The proposed method is general and applicable to cases with unequal numbers of poles and zeros. Compared with the generalized ARMA-Levinson algorithm, the proposed method has lower computational complexity without loss of accuracy. Numerical results are provided to demonstrate the effectiveness of the proposed method.
  • Keywords
    FIR filters; IIR filters; computational complexity; decision feedback equalisers; least mean squares methods; matrix algebra; poles and zeros; DFE; MMSE solution; computational complexity; decision feedback equalization; finite impulse response; generalized ARMA-Levinson algorithm; generalized system identification problem; long FIR filters; minimum mean-square error; stable IIR modeling; stable pole-zero modeling; structured matrices; Algorithm design and analysis; Computational complexity; Costs; Finite impulse response filter; Hardware; IIR filters; Linear matrix inequalities; Performance analysis; Poles and zeros; System identification; Levinson; computational complexity; minimum mean-square error (MMSE); pole-zero modeling; structured matrices;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Signals, Systems and Computers, 2008 42nd Asilomar Conference on
  • Conference_Location
    Pacific Grove, CA
  • ISSN
    1058-6393
  • Print_ISBN
    978-1-4244-2940-0
  • Electronic_ISBN
    1058-6393
  • Type

    conf

  • DOI
    10.1109/ACSSC.2008.5074704
  • Filename
    5074704