A fast algorithm for the \(n\)-D discrete cosine transform

DOI10.1007/BF02916871zbMath0914.65142MaRDI QIDQ1129829

Zhishun Wang, Wenhua Li, Zhenya He

Publication date: 5 November 1998

Published in: Science in China. Series E (Search for Journal in Brave)

zbMATH Keywords

computational complexitydiscrete cosine transformmultidimensional signal processingfast computational algorithm

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Numerical methods for discrete and fast Fourier transforms (65T50) Complexity and performance of numerical algorithms (65Y20)

Cites Work

• A new algorithm to compute the discrete cosine Transform
• A fast 4*4 DCT algorithm for the recursive 2-D DCT
• Discrete Cosine Transform

This page was built for publication: A fast algorithm for the \(n\)-D discrete cosine transform