Fast cosine transform of Toeplitz matrices, algorithm and applications

DOI10.1109/78.277808MaRDI QIDQ4276686zbMATH OpenOpenAlexFDO

Authors Martin Ohsmann

Publication date 10 March 1994

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

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

zbMATH Keywords

circulant matricesdiscrete cosine transformfast algorithmHankel matricesToeplitz matrix

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50)

Recommendations

• Fast transforms of Toeplitz matrices
• Fast discrete cosine transform algorithm for Hankel matrices
• scientific article; zbMATH DE number 2202319
• A fast algorithm for solving a Toeplitz system of equations
• A fast algorithm for the inversion of general Toeplitz matrices

Cited in

(12)

• Discrete wavelet transforms for Toeplitz matrices.
• Fast transforms of Toeplitz matrices
• Fast wavelet transform for Toeplitz matrices and property analysis
• On the Discrete Cosine Transform of Weakly Stationary Signals
• Fast discrete cosine transform algorithm for Hankel matrices
• A new fast algorithm for products of Toeplitz matrices
• Matrix Algebras and Displacement Decompositions
• scientific article; zbMATH DE number 2202319 (Why is no real title available?)
• Theorical aspects of the cosine transform
• Fast computation of Toeplitz forms under narrowband conditions with applications to statistical signal processing.
• A fast algorithm for computing a matrix transform used to detect trends in noisy data
• The use of discrete sine transform in computations with Toeplitz matrices

This page was built for publication: Fast cosine transform of Toeplitz matrices, algorithm and applications

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