Prime-factor DCT algorithms
Anna Tatsaki, Chrissavgi Dre, Thanos Stouraitis, C.E. Goutis · IEEE Transactions on Signal Processing · 1995
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.>