A two-dimensional fast cosine transform

DOI10.1109/TASSP.1985.1164737MaRDI QIDQ3757264zbMATH OpenOpenAlexFDO

Authors Munsi Alaul Haque

Publication date 1985

Published in IEEE Transactions on Acoustics, Speech, and Signal Processing (Search for Journal in Brave)

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

zbMATH Keywords

reduced dimensionfast cosine transform algorithmdecomposition of data sequencesinverse fast cosine transform

Mathematics Subject Classification ID

Numerical methods for trigonometric approximation and interpolation (65T40)

Recommendations

• A new two-dimensional fast cosine transform algorithm
• Fast algorithms for the discrete cosine transform
• New fast algorithm for two-dimensional discrete Fourier transform DFT(2ⁿ; 2)
• scientific article; zbMATH DE number 3926791
• The vector-radix fast cosine transform: Pruning and complexity analysis

Cited in

(10)

• Two new fast cosine transform (FCT) algorithms based on product system
• An economical method for compression of Fourier cosine transformations.
• scientific article; zbMATH DE number 4045625 (Why is no real title available?)
• A refined fast 2-D discrete cosine transform algorithm
• Fast computation of two-dimensional discrete cosine transforms using fast discrete radon transform
• On the regular structure for the fast 2-D DCT algorithm
• Fixed-point round-off error analysis for the discrete cosine transform
• A new two-dimensional fast cosine transform algorithm
• One- and two-dimensional constant geometry fast cosine transform algorithms and architectures
• scientific article; zbMATH DE number 3926791 (Why is no real title available?)

This page was built for publication: A two-dimensional fast cosine transform

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