Los puntos clave no están disponibles para este artículo en este momento.
An N -point discrete Fourier transform (DFT) algorithm can be used to evaluate a discrete cosine transform by a simple rearrangement of the input data. This method is about two times faster compared to the conventional method which uses a 2N -point DFT.
Narasimha et al. (Thu,) studied this question.