By Topic

An efficient algorithm for a large Toeplitz set of linear equations

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)

An algorithm is presented which requires 2n^{2} + 8n \log _{2} n - n computations for solving a set of n linear Toeplitz equations for n = 2k, where k is a positive integer. The previously known algorithms require a minimum of 3n2computations. The major advantage of the algorithm is realized for those applications where the set of n Toeplitz equations Tx = c is to be solved for a different c and the same T for the unknown x. Each additional solution requires storing only (4n + 1) elements from the first solution and 6n \log _{2} n + 3n computations.

Published in:

Acoustics, Speech and Signal Processing, IEEE Transactions on  (Volume:27 ,  Issue: 6 )