Type-II/III DCT/DST algorithms with reduced number of arithmetic operations
Abstract
We present algorithms for the discrete cosine transform (DCT) and discrete sine transform (DST), of types II and III, that achieve a lower count of real multiplications and additions than previously published algorithms, without sacrificing numerical accuracy. Asymptotically, the operation count is reduced from
- Publication:
-
Signal Processing
- Pub Date:
- January 2008
- DOI:
- 10.1016/j.sigpro.2008.01.004
- arXiv:
- arXiv:cs/0703150
- Bibcode:
- 2008SigPr..88.1553S
- Keywords:
-
- Discrete cosine transform;
- Fast Fourier transform;
- Arithmetic complexity;
- Computer Science - Numerical Analysis;
- Computer Science - Data Structures and Algorithms;
- Computer Science - Mathematical Software;
- F.2.1
- E-Print:
- 9 pages