By Topic

A comparison of two quantized state adaptive 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
$31 $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)
Sethares, W.A. ; Sch. of Electr. Eng., Cornell Univ., Ithaca, NY, USA ; Johnson, C.R.

Quantized state (QS) adaptive algorithms reduce the numerical complexity and dynamic range requirements of least mean squares (LMS) adaptation by replacing multiplications with shifts, bit comparisons, or table lookups. A theoretical foundation with which to distinguish two primary QS algorithm forms and to predict which algorithm is most appropriate in a given context is presented. An extended Lyapunov approach is used to derive a persistence of excitation (PE) condition which guarantees linear stability of the quantized error (QE) form. Averaging theory is then used to derive PE condition which guarantees exponential stability of the quantized regressor (QReg) form. Failure to meet this latter condition (which is not equivalent to the spectral richness PE condition for LMS) can result in exponential instability. The QE and QReg algorithms are then compared in terms of conditions for stability, convergence properties of the prediction and parameter errors, convergence rates, and steady-state errors.<>

Published in:

Acoustics, Speech and Signal Processing, IEEE Transactions on  (Volume:37 ,  Issue: 1 )