Title :
Fast cosine transform of Toeplitz matrices, algorithm and applications
Author_Institution :
RE Instrum. Germany, Julich, Germany
fDate :
10/1/1993 12:00:00 AM
Abstract :
A fast algorithm for the discrete cosine transform (DCT) of a Toeplitz matrix of order N is derived. Only O(N log N)+O(M) time is needed for the computation of M elements. The storage requirement is O(N). The method carries over to other transforms (DFT, DST) and to Hankel or circulant matrices. Some applications of the algorithm are discussed
Keywords :
computational complexity; discrete cosine transforms; matrix algebra; signal processing; DFT; DST; Hankel matrices; Toeplitz matrix; circulant matrices; discrete cosine transform; fast algorithm; signal processing; storage requirement; time complexity; Discrete Fourier transforms; Discrete cosine transforms; Discrete transforms; Eigenvalues and eigenfunctions; Equations; Image processing; Instruments; Signal processing; Signal processing algorithms;
Journal_Title :
Signal Processing, IEEE Transactions on
