By Topic

Adaptive recovery of a chirped sinusoid in noise. I. Performance of the RLS algorithm

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)
O. M. Machhi ; Lab. for Signals & Syst., CRNS-ESE, Gif-sur-Yvette, France ; N. J. Bershad

The authors study the ability of the exponentially weighted recursive least square (RLS) algorithm to track a complex chirped exponential signal buried in additive white Gaussian noise (power P n). The signal is a sinusoid whose frequency is drifting at a constant rate Ψ. lt is recovered using an M-tap adaptive predictor. Five principal aspects of the study are presented: the methodology of the analysis; proof of the quasi-deterministic nature of the data-covariance estimate R(k); a new analysis of RLS for an inverse system modeling problem; a new analysis of RLS for a deterministic time-varying model for the optimum filter; and an evaluation of the residual output mean-square error (MSE) resulting from the nonoptimality of the adaptive predictor (the misadjustment) in terms of the forgetting rate (β) of the RLS algorithm. It is shown that the misadjustment is dominated by a lag term of order β-2 and a noise term of order β. Thus, a value βopt exists which yields a minimum misadjustment. It is proved that βopt={(M+1)ρΨ2} 1/3, and the minimum misadjustment is equal to (3/4)Pn(M+1)βopt, where ρ is the input signal-to-noise ratio (SNR)

Published in:

IEEE Transactions on Signal Processing  (Volume:39 ,  Issue: 3 )