DocumentCode :
1475591
Title :
A refined fast 2-D discrete cosine transform algorithm
Author :
Huang, Yuh-Ming ; WU, JA-LING
Author_Institution :
Dept. of Comput. Sci. & Inf. Eng., Nat. Taiwan Univ., Taipei, Taiwan
Volume :
47
Issue :
3
fYear :
1999
fDate :
3/1/1999 12:00:00 AM
Firstpage :
904
Lastpage :
907
Abstract :
An index permutation-based fast two-dimensional discrete cosine transform (2-D DCT) algorithm is presented. It is shown that the N×N 2-D DCT, where N=2m, can be computed using only N 1-D DCTs and some post additions
Keywords :
computational complexity; digital arithmetic; discrete cosine transforms; signal processing; computational complexity; digital signal processing; discrete cosine transform; post additions; refined fast 2D DCT algorithm; Computational complexity; Computer science; Digital signal processing; Discrete cosine transforms; Kernel; Signal processing algorithms;
fLanguage :
English
Journal_Title :
Signal Processing, IEEE Transactions on
Publisher :
ieee
ISSN :
1053-587X
Type :
jour
DOI :
10.1109/78.747801
Filename :
747801
Link To Document :
بازگشت