By Topic

Finite-precision analysis of a covariance algorithm for least squares FIR filtering and AR modeling

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

2 Author(s)
G. -O. Glentis ; Dept. of Inf., Athens Univ., Greece ; N. Kalouptsidis

A numerically stable, fast, order-recursive algorithm for solving the covariance problem in signal modeling is described. The propagation of finite arithmetic errors as well as data acquisition errors is studied in detail. First, linearization of the main algorithmic recursions is carried out. Then, a suitable transformation converts the resulting state equations of the accumulated errors into their residual form. Subsequently, bounds for the residuals are computed. The derivation of these bounds depends heavily on the Levinson type structure of the algorithm and the low displacement rank of the problem. The main result is that the algorithm is weakly numerically stable. The proposed order-recursive algorithm is subsequently utilized as a block adaptive method. Its performance is also demonstrated by long run simulations

Published in:

IEEE Transactions on Signal Processing  (Volume:41 ,  Issue: 10 )