By Topic

Low-complexity variable forgetting factor mechanism for recursive least-squares algorithms in interference suppression applications

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 $31
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)
Yunlong Cai ; Dept. of Inf. Sci. & Electron. Eng., Zhejiang Univ., Hangzhou, China ; de Lamare, R.C.

In this work, the authors propose a low-complexity variable forgetting factor (VFF) mechanism for recursive least-squares algorithms in interference suppression applications. The proposed VFF mechanism employs an updated component related to the time average of the error correlation to automatically adjust the forgetting factor in order to ensure fast convergence and good tracking of the interference and the channel. Convergence and tracking analyses are carried out and analytical expressions for predicting the mean-squared error of the proposed adaptation technique are obtained. Simulation results for a direct-sequence code-division multiple access system are presented in non-stationary environments and show that the proposed VFF mechanism achieves superior performance to previously reported methods at a reduced complexity.

Published in:

Communications, IET  (Volume:7 ,  Issue: 11 )