By Topic

Fast algorithms for close-to-Toeplitz-plus-Hankel systems and two-sided linear prediction

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)
J. -J. Hsue ; Dept. of Electr. Eng. & Comput. Sci., Michigan Univ., Ann Arbor, MI, USA ; A. E. Yagle

The low-displacement-rank definition of close-to-Toeplitz (CT) matrices is extended to close-to-Toeplitz-plus-Hankel (CTPH) matrices. Fast algorithms for solving CTPH systems of equations are presented. A matrix is defined as CTPH if the sum of a CT matrix and a second CT matrix postmultiplied by an exchange matrix; an equivalent definition in terms of UV rank is also given. This definition is motivated by the application of the algorithms to two-sided linear prediction (TSP). Autocorrelation and covariance forms of TSP analogous to those for one-sided linear prediction (OSP) are defined. The covariance form of TSP is solved using the CTPH fast algorithms, just as the covariance form of OSP is solved using CT fast algorithms. Numerical examples show that TSP produces smaller residuals than OSP and resolves sharp spectral peaks better than OSP, and that covariance TSP produces smaller residuals than autocorrelation TSP

Published in:

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