By Topic

Convergent and roundoff error properties of reflection coefficients in adaptive spatial recursive least squares lattice algorithm

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 $13
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)
An, S.H. ; Dept. of Electr. Eng., California Univ., Los Angeles, CA, USA ; Yao, K.

The spatial recursive least-squares lattice (RLSL) algorithm is considered and the convergent properties as well as the finite-precision roundoff effects of the reflection coefficients are studied in detail. It is shown that when the forgetting factor λ is set equal to one, the reflection coefficients can converge to a constant with probability one with the rate of convergence being O(1/T 3/2) where T is the number of terms involved. When O<λ<1, the reflection coefficients converge weakly. Furthermore, the variable of the reflection coefficient is decreased by increasing λ. Thus, under stationary conditions λ should be taken as large as possible, while under nonstationary conditions λ should be taken such that the depth of memory in the system matches the rate of change of nonstationarity. Under a finite-wordlength constraint, λ should be taken to be less than some threshold, which is a function of the number of significant digits, such that the system can continuously adapt. In addition, it was found that the recursive form of computation for the reflection coefficient is better than direct form of computation

Published in:

Circuits and Systems, IEEE Transactions on  (Volume:35 ,  Issue: 2 )