On the algorithms for the computation of even discrete cosine transform-2 (EDCT-2) of real sequences
An algorithm based on O/sup 2/DFT (odd-time odd-frequency discrete Fourier transform) is presented for the computation of the EDCT-2 of purely real sequences. Comparison of this algorithm with two others available in the literature shows that it is computationally superior for EDCT-2 evaluation of real sequences (N>8). Its computational advantage is based on its lesser real multiplication requirements. >