Efficient Solution of a Toeplitz-Plus-Hankel Coefficient Matrix System of Equations

Date
1980-05-01
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract

Frequently in signal processing one is faced with situations where a large system of linear equations, with a Toeplitz or a Hankel coefficient matrix, needs to be solved. One efficient way of solving these kinds of equations is by Levinson recursion. The Levinson recursion does not require explicit storage of the Toeplitz (or Hankel) coefficient matrix and the number of multiplies required is proportional to the square of the number of unknowns.

Description
Tech Report
Advisor
Degree
Type
Report
Keywords
signal processing, linear equations, Levinson recursion, coefficient matrix
Citation

G. Merchant and T. Parks, "Efficient Solution of a Toeplitz-Plus-Hankel Coefficient Matrix System of Equations," Rice University ECE Technical Report, no. 8003, 1980.

Has part(s)
Forms part of
Published Version
Rights
Link to license
Citable link to this page