Rapidly converging adaptive IIR algorithms

Robert A. Soni, W. Kenneth Jenkins

    Research output: Contribution to conferencePaperpeer-review

    Abstract

    Several new adaptive infinite-impulse (IIR) filtering algorithms based upon the algorithm developed by Fan and Jenkins are proposed in this paper. The Fan-Jenkins algorithm was shown to experimentally possess the ability to converge to the global minimum of the mean square error (MSE) even in cases where the mean square error (MSE) surface is ill-conditioned. By incorporating estimates of the Hessian matrix in the adaptive filter coefficient update expressions, the new versions of the algorithm appear to improve convergence performance in comparison to traditional Least Mean Square (LMS) type algorithms and to preserve the ability of the algorithm to converge to the global minimum of the mean square error (MSE). Least Mean Square (LMS), Recursive Least Square (RLS), Gauss-Newton (GN), and Fast Quasi-Newton forms of the algorithm are formulated and compared via simulation.

    Original languageEnglish (US)
    Pages236-239
    Number of pages4
    StatePublished - 1996
    EventProceedings of the 1996 IEEE Southwest Symposium on Image Analysis and Interpretation - San Antonio, TX, USA
    Duration: Apr 8 1996Apr 9 1996

    Other

    OtherProceedings of the 1996 IEEE Southwest Symposium on Image Analysis and Interpretation
    CitySan Antonio, TX, USA
    Period4/8/964/9/96

    All Science Journal Classification (ASJC) codes

    • Computer Vision and Pattern Recognition

    Fingerprint

    Dive into the research topics of 'Rapidly converging adaptive IIR algorithms'. Together they form a unique fingerprint.

    Cite this