Variable forgetting factor LS algorithm for polynomial channel model

DOI10.5402/2011/915259MaRDI QIDQ630836zbMATH OpenOpenAlexWikidataFDO

Authors Amit Kumar Kohli, Amrita Rai, Meher Krishna Patel

Publication date 22 March 2011

Published in ISRN Signal Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.5402/2011/915259

Mathematics Subject Classification ID

Channel models (including quantum) in information and communication theory (94A40)

Review text

Summary: 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.

Recommendations

• Tracking improvements in fast RLS algorithms using a variable forgetting factor
• Gradient based variable forgetting factor RLS algorithm
• Performance analysis of the forgetting factor RLS algorithm
• Convergence analysis of the least-squares identification algorithm with a variable forgetting factor for time-varying linear systems
• scientific article; zbMATH DE number 627544

Cites work

• Tracking of time-varying channels using two-step LMS-type adaptive algorithm

Cited in

(3)

• Excision of ocular artifacts from EEG using NVFF-RLS adaptive algorithm
• Adaptive filtering techniques using cyclic prefix in OFDM systems for multipath fading channel prediction
• Tracking improvements in fast RLS algorithms using a variable forgetting factor

This page was built for publication: Variable forgetting factor LS algorithm for polynomial channel model

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q630836)