NLMS algorithm with decreasing step size for adaptive IIR filters

Authors:
Ching-An Lai
Affiliations:
Department of Electrical Engineering, Chinese Military Academy, Kaohsiung 830, Taiwan
Venue:
Signal Processing
Year:
2002

Citing 4
Cited 3

Adaptive signal processing

Adaptive signal processing
Adaptive filter theory

Adaptive filter theory
Experiments in nonconvex optimization: stochastic approximation with function smoothing and simulated annealing

Neural Networks
Globally convergent adaptive IIR filters based on fixed polelocations

IEEE Transactions on Signal Processing

Equalization of ultrasonic transducers based on evolutionary algorithm and IIR lattice filter

Engineering Applications of Artificial Intelligence
Efficient sign based normalized adaptive filtering techniques for cancelation of artifacts in ECG signals: Application to wireless biotelemetry

Signal Processing
Efficient Artifact Elimination in Cardiac Signals using Variable Step Size Adaptive Noise Cancellers

International Journal of Measurement Technologies and Instrumentation Engineering

Quantified Score

Hi-index	0.08

Visualization

Abstract

In this paper, we modify the GLMS algorithm to become the proposed LMS-SAS algorithm, which can more effectively converge to the global minimum of the mean-square output error (MSE) objective function. We also derive the infinite impulse response-normalized least-squares algorithm (IIR-NLMS), whose behavior is similar to the LMS-SAS algorithm. The GLMS algorithm achieves its global search capability by appending a random perturbing noise to the LMS algorithm. Similarly, we suggest that such perturbing noise is to be multiplied by its MSE objective function in the proposed LMS-SAS algorithm. For the NLMS algorithm, we use the gradient estimation error, which exists naturally in the adaptive process, to act as perturbing noise. We have shown, theoretically and experimentally, that the LMS-SAS and NLMS algorithm do converge to the global minimum.