By Topic

An efficient algorithm for solving general periodic Toeplitz systems

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)
M. Chakraborty ; Dept. of Electron. & Electr. Commun. Eng., Indian Inst. of Technol., Kharagpur, India

An efficient algorithm is presented for inverting matrices which are periodically Toeplitz, i.e., whose diagonal and subdiagonal entries exhibit periodic repetitions. Such matrices are not per symmetric and thus cannot be inverted by Trench's (1964) method. An alternative approach based on appropriate matrix factorization and partitioning is suggested. The algorithm provides certain insight on the formation of the inverse matrix, is implementable on a set of circularly pipelined processors and, as a special case, can be used for inverting a set of block Toeplitz matrices without requiring any matrix operation

Published in:

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