Fast Transforms: Algorithms, Analyses, Applications
Fast Transforms: Algorithms, Analyses, Applications
Orthogonal Transforms for Digital Signal Processing
Orthogonal Transforms for Digital Signal Processing
IEEE Transactions on Computers
A New Algorithm for Discrete Cosine Transform of Arbitrary Number of Points
IEEE Transactions on Computers
IEEE Transactions on Computers
A Storage Efficient Way to Implement the Discrete Cosine Transform
IEEE Transactions on Computers
Concurrent Error Detection in Fast Unitary Transform Algorithms
DSN '01 Proceedings of the 2001 International Conference on Dependable Systems and Networks (formerly: FTCS)
A fast algorithm for the computation of 2-D forward and inverse MDCT
Signal Processing
Interesting properties of the discrete cosine transform
Journal of Visual Communication and Image Representation
DCT-domain coder for digital video applications
Journal of Real-Time Image Processing
Collaborative image compression with error bounds in wireless sensor networks for crop monitoring
Computers and Electronics in Agriculture
| Hi-index | 14.98 |
Two types of efficient algorithms for fast implementation of the 2-D discrete cosine transform (2-D DCT) are developed. One involves recursive structure which implies that the algorithm for (M/2 X N/2) block be extended to (M X N/2) (M/2 X M) and (M X N) blocks (M and N are integer powers of two). The second algorithm is nonrecursive and therefore it has to be tailored for each block size. Both algorithms involve real arithmetic and they reduce the number of multiplications significantly compared to the fast algorithm developed by Chen et al. [8], while the number of additions remain unchanged.