New polynomial transform algorithm for multidimensional DCT

DOI10.1109/78.869031MaRDI QIDQ2734409zbMATH OpenOpenAlexFDO

Authors Yonghong Zeng, Guoan Bi, Abdul Rahim Leyman

Publication date 13 December 2001

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

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

zbMATH Keywords

fast algorithmmultidimensional discrete cosine transformmultidimensional signal processingpolynomial transform

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Recommendations

• New algorithm for multidimensional type-III DCT
• Combined polynomial transform and radix-\(q\) algorithm for multi-dimensional DCT-III
• On the computation of two-dimensional DCT
• A new two-dimensional fast cosine transform algorithm
• New algorithms for multidimensional discrete Hartley transform

Cited in

(10)

• Chebyshev polynomial derivation of composite-length DCT algorithms
• Polynomial transform based algorithms for computing two-dimensional generalized DFT, generalized DHT, and skew circular convolution.
• Multidimensional polynomial transform algorithm for multidimensional discrete Hartley transform
• Multidimensional polynomial transform algorithm for multidimensional discrete W transform
• New algorithm for multidimensional type-III DCT
• A new look at DCT-type transforms
• Fast Computation of MD-DCT-IV/MD-DST-IV by MD-DWT or MD-DCT-II
• A new square wave transform based on the DCT
• Combined polynomial transform and radix-\(q\) algorithm for multi-dimensional DCT-III
• The generalized unified computation of multidimensional discrete orthogonal transforms

This page was built for publication: New polynomial transform algorithm for multidimensional DCT

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