Cart (Loading....) | Create Account
Close category search window
 

Efficient computation of tr{TR-1} for Toeplitz matrices

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)
Dias, J.M.B. ; Instituto de Telecomunicacoes, Instituto Superior Tecnico, Lisbon, Portugal ; Leitao, J.M.N.

An efficient algorithm for the computation of tr{TR/sup -1/}, where T and R are Toeplitz matrices and R is also symmetric positive definite, is presented. The method exploits the fact that the trace of TR/sup -1/ depends only on the sum of the diagonals of R/sup -1/, and not on the whole matrix R/sup -1/. To obtain this sum, a fast efficient technique, built upon the Trench (1964) algorithm for computing the inverse of a Toeplitz matrix, is developed. The complexity of the algorithm depends on the generation function of matrix R and is O(N ln N) for generic functions and O(p ln p) for AR(p) functions.

Published in:

Signal Processing Letters, IEEE  (Volume:9 ,  Issue: 2 )

Date of Publication:

Feb. 2002

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.