Is there a DCT library in Java which computes DCT in logarithmic time? I read that DCT can be computed with FFT algorithms, so there should also be a logarithmic time algorithm for dct.
You can compute a DCT by mirroring the data to double its length and doing an FFT on that double length vector.
Only the cosine terms of an FFT will be non-zero (except for numerical/rounding noise) for mirror symmetric (an even function about the center of the window) data.
The technical post webpages of this site follow the CC BY-SA 4.0 protocol. If you need to reprint, please indicate the site URL or the original address.Any question please contact:yoyou2525@163.com.