DocumentCode
1348786
Title
Comments on "Fast algorithms and implementation of 2-D discrete cosine transform"
Author
Wu, Hong Ren ; Man, Zhihong
Author_Institution
Dept. of Digital Syst., Monash Univ., Clayton, Vic., Australia
Volume
8
Issue
2
fYear
1998
fDate
4/1/1998 12:00:00 AM
Firstpage
128
Lastpage
129
Abstract
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.
Keywords
computational complexity; digital arithmetic; discrete cosine transforms; image coding; transform coding; 1D discrete cosine transform; 2D DCT algorithm; 2D discrete cosine transform; DCT; digital image coding; digital video coding; fast algorithms; multiplicative complexity theory; optimal algorithm; Circuits; Complexity theory; Digital arithmetic; Digital images; Digital systems; Discrete cosine transforms; Discrete transforms; Polynomials; Two dimensional displays; Video coding;
fLanguage
English
Journal_Title
Circuits and Systems for Video Technology, IEEE Transactions on
Publisher
ieee
ISSN
1051-8215
Type
jour
DOI
10.1109/76.664096
Filename
664096
Link To Document