FAST COMPUTATIONAL ALGORITHMS FOR THE DISCRETE COSINE TRANSFORM
M. Chelemal-D, K.R. Rao · 1986
Fast algorithms for computation of the discrete cosine transform (DCT) are evaluated. Implementation via the fast Fourier transform and also by the direct method are considered. DCT algorithms for arbitrary sequence lengths are also included.