• DocumentCode
    1512512
  • Title

    Set-membership affine projection algorithm

  • Author

    Werner, Stefan ; Diniz, Paulo S R

  • Author_Institution
    Signal Process. Lab., Helsinki Univ. of Technol., Espoo, Finland
  • Volume
    8
  • Issue
    8
  • fYear
    2001
  • Firstpage
    231
  • Lastpage
    235
  • Abstract
    This letter presents a new data selective adaptive filtering algorithm, the set-membership affine projection (SM-AP) algorithm. The algorithm generalizes the idea of the set-membership NLMS (SM-NLMS) algorithm to include constraint sets constructed from the past input and desired signal pairs. The resulting algorithm can be seen as a set-membership version of the affine-projection (AP) algorithm with an optimized step size. Also, the SM-AP algorithm does not trade convergence speed with misadjustment and computational complexity as most adaptive filtering algorithms. Simulations show the good performance of the algorithm, especially for colored input signals, in terms of convergence, final misadjustment, and reduced computational complexity.
  • Keywords
    adaptive filters; computational complexity; convergence of numerical methods; least mean squares methods; SM-AP algorithm; SM-NLMS; computational complexity; constraint sets; convergence speed; data selective adaptive filtering algorithm; misadjustment; optimized step size; set-membership NLMS; set-membership affine projection algorithm; signal pairs; Adaptive filters; Computational complexity; Convergence; Estimation error; Filtering algorithms; Least squares approximation; Projection algorithms; Resonance light scattering; Signal processing algorithms; Upper bound;
  • fLanguage
    English
  • Journal_Title
    Signal Processing Letters, IEEE
  • Publisher
    ieee
  • ISSN
    1070-9908
  • Type

    jour

  • DOI
    10.1109/97.935739
  • Filename
    935739