Prime-Factor DCT Algorithms

Anna Tatsaki, Chrissavgi Dre, Thanos Stouraitis, Costas Goutis

Research output: Contribution to journalArticlepeer-review

17 Scopus citations


In this correspondence, new algorithms are presented for computing the 1-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.

Original languageBritish English
Pages (from-to)772-776
Number of pages5
JournalIEEE Transactions on Signal Processing
Issue number3
StatePublished - Mar 1995


Dive into the research topics of 'Prime-Factor DCT Algorithms'. Together they form a unique fingerprint.

Cite this