Table of Contents
ISRN Signal Processing
Volume 2011, Article ID 915259, 4 pages
Research Article

Variable Forgetting Factor LS Algorithm for Polynomial Channel Model

1Department of Electronics and Communication Engineering, Thapar University, Punjab 147004, Patiala, India
2Electronics and Communication Engineering Department, Lingaya's University, Faridabad 121002, India
3TBRL, DRDO, Chandigarh 160020, India

Received 3 November 2010; Accepted 15 December 2010

Academic Editors: V. Chandran, E. Ciaccio, X. Jiang, and C.-M. Kuo

Copyright © 2011 Amit Kumar Kohli et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


Variable forgetting factor (VFF) least squares (LS) algorithm for polynomial channel paradigm is presented for improved tracking performance under nonstationary environment. The main focus is on updating VFF when each time-varying fading channel is considered to be a first-order Markov process. In addition to efficient tracking under frequency-selective fading channels, the incorporation of proposed numeric variable forgetting factor (NVFF) in LS algorithm reduces the computational complexity.