Prime-Factor DCT Algorithms

Anna Tatsaki; Chrissavgi Dre; Thanos Stouraitis; Costas Goutis

doi:10.1109/78.370632

Prime-Factor DCT Algorithms

Anna Tatsaki, Chrissavgi Dre, Thanos Stouraitis, Costas Goutis

Electrical Engineering

University of Patras

Research output: Contribution to journal › Article › peer-review

17 Scopus citations

Abstract

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 language	British English
Pages (from-to)	772-776
Number of pages	5
Journal	IEEE Transactions on Signal Processing
Volume	43
Issue number	3
DOIs	https://doi.org/10.1109/78.370632
State	Published - Mar 1995

Access to Document

10.1109/78.370632

Cite this

@article{7970295659ce4a1e809e5446091771aa,

title = "Prime-Factor DCT Algorithms",

abstract = "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.",

author = "Anna Tatsaki and Chrissavgi Dre and Thanos Stouraitis and Costas Goutis",

year = "1995",

month = mar,

doi = "10.1109/78.370632",

language = "British English",

volume = "43",

pages = "772--776",

journal = "IEEE Transactions on Signal Processing",

issn = "1053-587X",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "3",

}

TY - JOUR

T1 - Prime-Factor DCT Algorithms

AU - Tatsaki, Anna

AU - Dre, Chrissavgi

AU - Stouraitis, Thanos

AU - Goutis, Costas

PY - 1995/3

Y1 - 1995/3

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0029277656&partnerID=8YFLogxK

U2 - 10.1109/78.370632

DO - 10.1109/78.370632

M3 - Article

AN - SCOPUS:0029277656

SN - 1053-587X

VL - 43

SP - 772

EP - 776

JO - IEEE Transactions on Signal Processing

JF - IEEE Transactions on Signal Processing

IS - 3

ER -

Prime-Factor DCT Algorithms

Abstract

Access to Document

Other files and links

Fingerprint

Cite this