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

Simple item page
dc.citation.bibtexNametechreporten_US
dc.citation.issueNumber8003en_US
dc.citation.journalTitleRice University ECE Technical Reporten_US
dc.contributor.authorMerchant, G.A.en_US
dc.contributor.authorParks, T.W.en_US
dc.date.accessioned2007-10-31T00:53:08Z
dc.date.available2007-10-31T00:53:08Z
dc.date.issued1980-05-01en
dc.date.modified2004-04-20en_US
dc.date.submitted2004-04-20en_US
dc.descriptionTech Reporten_US
dc.description.abstractFrequently 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.en_US
dc.identifier.citationG. Merchant and T. Parks, "Efficient Solution of a Toeplitz-Plus-Hankel Coefficient Matrix System of Equations," <i>Rice University ECE Technical Report,</i> no. 8003, 1980.
dc.identifier.urihttps://hdl.handle.net/1911/20092
dc.language.isoeng
dc.subjectsignal processing*
dc.subjectlinear equations*
dc.subjectLevinson recursion*
dc.subjectcoefficient matrix*
dc.subject.keywordsignal processingen_US
dc.subject.keywordlinear equationsen_US
dc.subject.keywordLevinson recursionen_US
dc.subject.keywordcoefficient matrixen_US
dc.titleEfficient Solution of a Toeplitz-Plus-Hankel Coefficient Matrix System of Equationsen_US
dc.typeReport
dc.type.dcmiText
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Mer1980May9EfficientS.PDF
Size:
332.41 KB
Format:
Adobe Portable Document Format
Download
Collections
ECE Publications
DSP Publications