By Topic

Failure time analysis for LMS algorithms

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
A. A. Zerai ; Electron. Eng. Dept., Coll. of Technol. Studies, Shuwaikh, Kuwait ; J. A. Bucklew

Few results are available in the literature on failure time (in contrast with long time average) analysis of the least mean square (LMS) adaptive algorithms (filters). Such analysis is extremely important when failure of the algorithm could cause failure of the entire system in which they are employed. A system may fail upon the first occurrence of a large error (any value far from 0), or upon staying far from 0 for a period of time (a clump of large errors). We use a Poisson approximation to study excursions (failure) of the LMS algorithm and its three signed variants. The distribution and the mean of the first excursion are approximated with the mean and distribution of an exponential distribution. The number of excursions in n units of time is approximated by a Poisson distribution. We also approximate the mean of an excursion length (clump size). The approximations are derived asymptotically as the excursion-defining set converges to the empty set, and as the algorithm step size converges to 0

Published in:

IEEE Transactions on Information Theory  (Volume:48 ,  Issue: 4 )