Variable Forgetting Factor LS Algorithm for Polynomial Channel Model
Joint Authors
Patel, Meher Krishna
Rai, Amrita
Kohli, Amit Kumar
Source
Issue
Vol. 2011, Issue 2011 (31 Dec. 2011), pp.1-4, 4 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2010-12-30
Country of Publication
Egypt
No. of Pages
4
Main Subjects
Electronic engineering
Information Technology and Computer Science
Abstract EN
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.
American Psychological Association (APA)
Kohli, Amit Kumar& Rai, Amrita& Patel, Meher Krishna. 2010. Variable Forgetting Factor LS Algorithm for Polynomial Channel Model. ISRN Signal Processing،Vol. 2011, no. 2011, pp.1-4.
https://search.emarefa.net/detail/BIM-507753
Modern Language Association (MLA)
Kohli, Amit Kumar…[et al.]. Variable Forgetting Factor LS Algorithm for Polynomial Channel Model. ISRN Signal Processing No. 2011 (2011), pp.1-4.
https://search.emarefa.net/detail/BIM-507753
American Medical Association (AMA)
Kohli, Amit Kumar& Rai, Amrita& Patel, Meher Krishna. Variable Forgetting Factor LS Algorithm for Polynomial Channel Model. ISRN Signal Processing. 2010. Vol. 2011, no. 2011, pp.1-4.
https://search.emarefa.net/detail/BIM-507753
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-507753
