【摘要】 <正> 本文提出多维离散余弦变换(DCT)的一个快速算法。我们将点数为2的整次幂的p维离散信号,按照编号偶数正序、奇数逆序进行重排。经过适当地变换,就将p维DCT导致p维DFT。再利用文献[1]或[2]中处理多维DFT的新方法,就可获得p维DCT的快速算法。本算法直观、简明、且易于在计算机上实现。更多还原

【Abstract】 An efficient algorithm for fast implementation of the p-dimensional discrete co-sine transforms is developed. It is shown that the result may be obtained using onlya p-dimensional DFT of size N₁×N₂×…×N_p of a reordered version of the originalsignal, with a resultant saving of 1/2^p over the traditional method that employs theDFT. Procedures for the forward and inverse fast discrete cosine transforms are pre-sented fop easy implementation on the computer.更多还原