By Topic

Variable Step-Size LMS Algorithm for Fractal Signals

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)
Gupta, Anubha ; Netaji Subhas Inst. of Technol., Delhi ; Joshi, S.D.

This paper presents a novel variable step-size LMS (VSLMS) algorithm for tracking signals from the Gaussian 1/fbeta family of fractal signals that are inherently nonstationary. The proposed algorithm differs from the existing VSLMS algorithms in the following ways: 1) it deals with a specific class of nonstationary signals, 2) it utilizes a nondiagonal step-size matrix which is simultaneously diagonalizable with the auto-covariance matrix of the input signal, 3) in the decoupled weight vector space, one of the step-size parameters requires time-varying constraints for the algorithm to converge to the optimal weights whereas the constraints on the remaining step-size parameters are time-invariant, and 4) it computes the step-size matrix by estimating the Hurst exponent required to characterize the statistical properties of the signal at the input of the adaptive filter. The experimental setup of an adaptive channel equalizer is considered for equalization of fractal signals transmitted over stationary AWGN channel. The performance of the proposed fractal-based variable step-size least mean square (FB-VSLMS) algorithm is compared with the unsigned VSLMS algorithm and is observed to be better for the class of nonstationary signals considered.

Published in:

Signal Processing, IEEE Transactions on  (Volume:56 ,  Issue: 4 )