By Topic

On the convergence of the CORDIC adaptive lattice filtering (CALF) 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
$33 $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

1 Author(s)
Yu Hen Hu ; Dept. of Electr. & Comput. Eng., Wisconsin Univ., Madison, WI, USA

In this paper, the convergence of a previously proposed CORDIC adaptive lattice filtering (CALF) algorithm is proved. It is shown that the update of the rotation angle (which is equivalent to the reflection coefficient) can be modeled by the state transition of a regular Markov chain, with each rotation angle being a state. The convergence of the CALF algorithm then is established as this Markov chain converges from an initial state probability distribution to its limiting state probability distribution. Formulae that enable explicit calculation of the limiting state distribution are derived. Moreover, it is shown that the algorithm has an exponential convergence rate

Published in:

IEEE Transactions on Signal Processing  (Volume:46 ,  Issue: 7 )