By Topic

Bowtie factors of Toeplitz matrices by means of split algorithms

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

1 Author(s)
Demeure, C.J. ; Dept. of Electr. & Comput Eng., Colorado Univ., Boulder, CO

The bowtie factorization of a Toeplitz correlation matrix R and its inverse is introduced. The term bowtie describes the pattern of the factoring matrices. Several mathematical properties of bowtie matrices are described, including their close relation with block triangular matrices. The bowtie factors of the inverse R can be computed using a vector version of the split Levinson algorithm, restricted to orders with the same parity as n, the dimension of R. The bowtie factors of R can be computed using split vector versions of the Schur algorithm. The orthogonal factorization of the underlying data matrix Y can also be computed by the split versions of the lattice algorithm, producing a bowtie orthogonal factor of Y

Published in:

Acoustics, Speech and Signal Processing, IEEE Transactions on  (Volume:37 ,  Issue: 10 )