DocumentCode
750014
Title
Prime-factor DCT algorithms
Author
Tatsaki, Anna ; Dre, Chrissavgi ; Stouraitis, Thanos ; Goutis, Costas
Author_Institution
Dept. of Electr. Eng., Patras Univ., Greece
Volume
43
Issue
3
fYear
1995
fDate
3/1/1995 12:00:00 AM
Firstpage
772
Lastpage
776
Abstract
In this correspondence, new algorithms are presented for computing the l-D and 2-D discrete cosine transform (DCT) of even length by using the discrete Fourier transform (DFT). A comparison of the proposed algorithms to other fast ones points out their computational efficiency, which is mainly based on the advantages of prime-factor decomposition and a proper choice of index mappings
Keywords
digital arithmetic; discrete Fourier transforms; signal processing; 2-D discrete cosine transform; DFT; DSP; computational efficiency; digital signal processing; discrete Fourier transform; index mappings; l-D discrete cosine transform; prime-factor DCT algorithms; prime-factor decomposition; Bandwidth; Computational efficiency; Digital signal processing; Discrete Fourier transforms; Discrete cosine transforms; Image coding; Phase frequency detector; Signal processing; Signal processing algorithms; Speech processing;
fLanguage
English
Journal_Title
Signal Processing, IEEE Transactions on
Publisher
ieee
ISSN
1053-587X
Type
jour
DOI
10.1109/78.370632
Filename
370632
Link To Document