This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Fast Algorithms for the 2-D Discrete Cosine Transform
September 1982 (vol. 31 no. 9)
pp. 899-906
F.A. Kamangar, Department of Electrical Engineering, University of Texas
Two types of efficient algorithms for fast implementation of the 2-D discrete cosine transform (2-D DCT) are developed. One involves recursive structure which implies that the algorithm for (M/2 X N/2) block be extended to (M X N/2) (M/2 X M) and (M X N) blocks (M and N are integer powers of two). The second algorithm is nonrecursive and therefore it has to be tailored for each block size. Both algorithms involve real arithmetic and they reduce the number of multiplications significantly compared to the fast algorithm developed by Chen et al. [8], while the number of additions remain unchanged.
Index Terms:
recursive and nonrecursive, Discrete transforms, fast algorithms
Citation:
F.A. Kamangar, K.R. Rao, "Fast Algorithms for the 2-D Discrete Cosine Transform," IEEE Transactions on Computers, vol. 31, no. 9, pp. 899-906, Sept. 1982, doi:10.1109/TC.1982.1676108
Usage of this product signifies your acceptance of the Terms of Use.