Convergence Analysis of Adaptive Filters Using Normalized Sign-Sign Algorithm

Authors:
Shin'Ichi Koike
Affiliations:
The author is Consultant, Tokyo, Japan. E-mail: shin-koike@mub.biglobe.ne.jp
Venue:
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Year:
2005

Citing 0
Cited 2

On the Performance Analysis of the Least Mean M-Estimate and Normalized Least Mean M-Estimate Algorithms with Gaussian Inputs and Additive Gaussian and Contaminated Gaussian Noises

Journal of Signal Processing Systems
On the Performance Analysis of a Class of Transform-domain NLMS Algorithms with Gaussian Inputs and Mixture Gaussian Additive Noise Environment

Journal of Signal Processing Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

This letter develops convergence analysis of normalized sign-sign algorithm (NSSA) for FIR-type adaptive filters, based on an assumption that filter tap weights are Gaussian distributed. We derive a set of difference equations for theoretically calculating transient behavior of filter convergence, when the filter input is a White & Gaussian process. For a colored Gaussian input and a large number of tap weights, approximate difference equations are also proposed. Experiment with simulations and theoretical calculations of filter convergence demonstrates good agreement between simulations and theory, proving the validity of the analysis.