Type-II/III DCT/DST algorithms with reduced number of arithmetic operations

TL;DR

This paper introduces new algorithms for type-II and III DCT and DST that significantly reduce the number of arithmetic operations needed, improving efficiency while maintaining accuracy, through innovative use of FFT-based techniques.

Contribution

The paper presents novel reduced-operation algorithms for DCT and DST types II and III, extending previous methods with asymptotic improvements and input/output rescaling techniques.

Findings

Operation count reduced from ~2N log_2 N to ~ (17/9) N log_2 N for power-of-two N

Additional N multiplications saved via input/output rescaling

Algorithms derived from optimized FFT-based approaches

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 ~ 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.