摘要: A fast radix-2 two dimensional discrete cosine transform (DCT) is presented. First, the mapping into a 2-D Fourier (DFT) of real signal improved. Then an usual polynomial approach used in order to map DFT reduced size and one odd DFT's. Finally, optimized algorithms for signals are developped. All together, reduction more than 50% number multiplications comparable amount additions obtained comparison other algorithm.
researchgate.net 
sci-hub.se 参考文章(9)
J. Makhoul, A fast cosine transform in one and two dimensions IEEE Transactions on Acoustics, Speech, and Signal Processing. ,vol. 28, pp. 27- 34 ,(1980) , 10.1109/TASSP.1980.1163351
Martin Vetterli, member Eurasip, Henri J. Nussbaumer, Simple FFT and DCT algorithms with reduced number of operations Signal Processing. ,vol. 6, pp. 267- 278 ,(1984) , 10.1016/0165-1684(84)90059-8
N. Nasrabadi, R. King, Computationally efficient discrete cosine transform algorithm Electronics Letters. ,vol. 19, pp. 24- 25 ,(1983) , 10.1049/EL:19830017
M. Narasimha, A. Peterson, On the Computation of the Discrete Cosine Transform IEEE Transactions on Communications. ,vol. 26, pp. 934- 936 ,(1978) , 10.1109/TCOM.1978.1094144
Wen-Hsiung Chen, C. Smith, S. Fralick, A Fast Computational Algorithm for the Discrete Cosine Transform IEEE Transactions on Communications. ,vol. 25, pp. 1004- 1009 ,(1977) , 10.1109/TCOM.1977.1093941
A.K. Jain, Image data compression: A review Proceedings of the IEEE. ,vol. 69, pp. 349- 389 ,(1981) , 10.1109/PROC.1981.11971
Henri J. Nussbaumer, Fast Fourier transform and convolution algorithms ,(1981)
H. Nussbaumer, P. Quandalle, Fast computation of discrete Fourier transforms using polynomial transforms IEEE Transactions on Acoustics, Speech, and Signal Processing. ,vol. 27, pp. 169- 181 ,(1979) , 10.1109/TASSP.1979.1163216
L. Morris, Automatic generation of time efficient digital signal processing software IEEE Transactions on Acoustics, Speech, and Signal Processing. ,vol. 25, pp. 74- 79 ,(1977) , 10.1109/TASSP.1977.1162900