Type-II/III DCT/DST algorithms with reduced number of arithmetic operations
<|reference_start|>Type-II/III DCT/DST algorithms with reduced number of arithmetic operations: 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 ~ 2N log_2 N to ~ (17/9) N log_2 N for a power-of-two transform size N. Furthermore, we show that a further N multiplications may be saved by a certain rescaling of the inputs or outputs, generalizing a well-known technique for N=8 by Arai et al. These results are derived by considering the DCT to be a special case of a DFT of length 4N, with certain symmetries, and then pruning redundant operations from a recent improved fast Fourier transform algorithm (based on a recursive rescaling of the conjugate-pair split radix algorithm). The improved algorithms for DCT-III, DST-II, and DST-III follow immediately from the improved count for the DCT-II.<|reference_end|>
@article{shao2007type-ii/iii,
    title={Type-II/III DCT/DST algorithms with reduced number of arithmetic
  operations},
    author={Xuancheng Shao and Steven G. Johnson},
    journal={Signal Processing vol. 88, issue 6, p. 1553-1564 (2008)},
    year={2007},
    doi={10.1016/j.sigpro.2008.01.004},
    archivePrefix={arXiv},
    eprint={cs/0703150},
    primaryClass={cs.NA cs.DS cs.MS}
}