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

DOI10.1109/78.224244MaRDI QIDQ4275209zbMATH OpenOpenAlexFDO

Authors Jin-Jen Hsue, Andrew E. Yagle

Publication date 8 February 1994

Published in IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/78.224244

zbMATH Keywords

time serieslinear predictionfast algorithmsNumerical examplesclose-to-Toeplitz-plus-Hankel systems

Mathematics Subject Classification ID

Hermitian, skew-Hermitian, and related matrices (15B57) Special processes (60K99)

Recommendations

• New Fast Algorithms for Toeplitz-Plus-Hankel Matrices
• New analogs of split algorithms for arbitrary Toeplitz-plus-Hankel matrices
• Fast recursive algorithms for a class of linear equations
• Publication:4207515
• Fast algorithms for linear prediction and system identification filters with linear phase

Cited in

(3)

• Fast algorithms for perturbed Toeplitz-plus-Hankel system based on discrete cosine transform and their applications
• Efficient algorithms for perturbed symmetrical Toeplitz-plus-Hankel systems
• Time-frequency analysis of multichannel signals using two-sided autoregressive modeling

This page was built for publication: Fast algorithms for close-to-Toeplitz-plus-Hankel systems and two-sided linear prediction

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4275209)