Extensions on Low-Complexity DCT Approximations for Larger Blocklengths Based on Minimal Angle Similarity
Abstract
References
Recommendations
Fast approximate DCT with GPU implementation for image compression
A multiplierless efficient and low complexity 8-point approximate DCT is proposed.A flow diagram is provided for the fast computation.The proposed transform is suitable for fast high performance compression.A GPU implementation is provided for further ...
Type-IV DCT, DST, and MDCT algorithms with reduced numbers of arithmetic operations
We present algorithms for the type-IV discrete cosine transform (DCT-IV) and discrete sine transform (DST-IV), as well as for the modified discrete cosine transform (MDCT) and its inverse, that achieve a lower count of real multiplications and additions ...
DCT-Based Real-Valued Discrete Gabor Transform and Its Fast Algorithms
CCCM '08: Proceedings of the 2008 ISECS International Colloquium on Computing, Communication, Control, and Management - Volume 02The traditional DCT-based real-valued discrete Gabor transform (RGDT) was limited to the critical sampling case. The biorthogonality relationship between the analysis window and synthesis window for the transform was not unveiled. To overcome those ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
Publisher
Kluwer Academic Publishers
United States
Publication History
Author Tags
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0