By Topic

Comments on "Fast algorithms and implementation of 2-D discrete cosine transform"

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)
Hong Ren Wu ; Dept. of Digital Syst., Monash Univ., Clayton, Vic., Australia ; Zhihong Man

This paper shows that using the Loeffler's (see Proc. IEEE ICASSP, vol.2, p.988-91, 1989) one-dimensional (1-D) 8-point discrete cosine transform (DCT) algorithm in Cho and Lee's (see ibid., vol.38, p.297-305, 1991) two-dimensional (2-D) 8/spl times/8-point DCT algorithm will result in an optimal algorithm in the sense of multiplicative complexity theory.

Published in:

Circuits and Systems for Video Technology, IEEE Transactions on  (Volume:8 ,  Issue: 2 )