Convergence analysis of a frequency domain adaptive filter with constraints on the output weights

Authors:
Walter J. Kozacky;Tokunbo Ogunfunmi
Affiliations:
Department of Electrical Engineering, Santa Clara University, Santa Clara, CA;Department of Electrical Engineering, Santa Clara University, Santa Clara, CA
Venue:
Asilomar'09 Proceedings of the 43rd Asilomar conference on Signals, systems and computers
Year:
2009

Citing 6
Cited 0

Adaptive signal processing

Adaptive signal processing
Leaky LMS algorithm: MSE analysis for Gaussian data

IEEE Transactions on Signal Processing
Performance comparison of two implementations of the leaky LMSadaptive filter

IEEE Transactions on Signal Processing
Analysis of the frequency-domain block LMS algorithm

IEEE Transactions on Signal Processing
A computationally efficient frequency-domain LMS algorithm withconstraints on the adaptive filter

IEEE Transactions on Signal Processing
A delayless subband adaptive filter architecture

IEEE Transactions on Signal Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The least-mean-square (LMS) algorithm is very popular in adaptive filtering applications due to its robustness and efficiency. The frequency domain implementation of the LMS algorithm offers advantages in both reduced computational complexity for long filter lengths, and improved convergence performance. The frequency response of the filter can also be tailored to specific requirements, for example limiting the magnitude response. In this paper, we present a development, convergence analysis, and mean and mean square stability bounds for a new algorithm that uses a penalty function to limit the adaptive filter magnitude response at any given frequency. This algorithm performed better than existing ones in terms of convergence and gain limiting, especially in colored noise environments.