Variable forgetting factor LS algorithm for polynomial channel model (Q630836)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Variable forgetting factor LS algorithm for polynomial channel model |
scientific article; zbMATH DE number 5869000
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Variable forgetting factor LS algorithm for polynomial channel model |
scientific article; zbMATH DE number 5869000 |
Statements
Variable forgetting factor LS algorithm for polynomial channel model (English)
0 references
22 March 2011
0 references
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.
0 references
