By Topic

A two-dimensional fast cosine transform algorithm based on Hou's approach

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Wu, H.R. ; Dept. of Robotics & Digital Technol., Monash Univ., Melbourne, Vic., Australia ; Paoloni, F.J.

A structured approach is used to generate a fast algorithm to compute two-dimensional discrete cosine transforms (DCT) based on Hou's method. Hou's algorithm is extended to the 2-D case using an approach presented in both matrix and diagrammatical forms. The matrix approach is discussed, and this forms a basis on which a 2-D fast DCT algorithm is derived. It is shown that this matrix method has a structure similar to that of the 1-D Cooley-Tukey fast Fourier transform (FFT) algorithm. Then the decimation-in-frequency (DIF) 2-D fast DCT algorithm is presented using matrix forms which use the tensor (or Kronecker) product as a construction tool. Finally, the 2-D algorithm is described by logic diagrams which reveal the relationship between the 2-D algorithm and its 1-D counterpart. As an example, the logic diagram of an 8-point×8-point 2-D DCT using the new 2-D DCT algorithm is generated through a simple procedure

Published in:

Signal Processing, IEEE Transactions on  (Volume:39 ,  Issue: 2 )