• DocumentCode
    2892321
  • Title

    Frequency-domain adaptive filtering: a set-membership approach

  • Author

    Li Guo ; Ekpenyong, Anthony ; Huang, Yih-Fang

  • Author_Institution
    Dept. of Electr. Eng., Notre Dame Univ., IN, USA
  • Volume
    2
  • fYear
    2003
  • fDate
    9-12 Nov. 2003
  • Firstpage
    2073
  • Abstract
    Frequency-domain adaptive filtering has been shown to have the advantage of low complexity compared to its time-domain counterpart In this paper, a frequency-domain Set-Membership Normalized Least-Mean-Square (F-SM-NLMS) algorithm is derived, and shown to have better performance (in terms of convergence and bit error rate (BER)) and less updates than frequency-domain Normalized Least-Mean-Square (F-NLMS) algorithm. We also propose an updator-sharing scheme to reduce filter complexity of frequency-domain adaptive filtering. The results show significant savings in complexity with little compromise of performance.
  • Keywords
    adaptive filters; convergence; error statistics; frequency-domain analysis; least mean squares methods; BER; NLMS; bit error rate; convergence; filter complexity reduction; frequency-domain adaptive filtering; normalized least-mean-square algorithm; set-membership approach; updator-sharing scheme; Adaptive equalizers; Adaptive filters; Convergence; Diversity reception; Filtering algorithms; Finite impulse response filter; Frequency; Least squares approximation; Steady-state; Time domain analysis;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Signals, Systems and Computers, 2004. Conference Record of the Thirty-Seventh Asilomar Conference on
  • Print_ISBN
    0-7803-8104-1
  • Type

    conf

  • DOI
    10.1109/ACSSC.2003.1292345
  • Filename
    1292345