A fast algorithm for computing multidimensional dct on certain small sizes
DOI10.1109/TSP.2002.806558zbMATH Open1369.94111DBLPjournals/tsp/ChenDL03OpenAlexW2129247537WikidataQ55970230 ScholiaQ55970230MaRDI QIDQ5353733FDOQ5353733
Authors: Xinjian Chen, Qionghai Dai, Chun-Wen Li 
Publication date: 8 September 2017
Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tsp.2002.806558
Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Numerical methods for discrete and fast Fourier transforms (65T50)
Cited In (6)
- Worst-case error analysis of lifting-based fast DCT-algorithms
- Low-Complexity Scaling Methodsfor DCT-II Approximations
- New algorithm for multidimensional type-III DCT
- Shifted Fourier transform-based tensor algorithms for the 2-D DCT
- Combined polynomial transform and radix-\(q\) algorithm for multi-dimensional DCT-III
- Integer DCTs and fast algorithms
This page was built for publication: A fast algorithm for computing multidimensional dct on certain small sizes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5353733)
