NEW FAST RECURSIVE ALGORITHMS FOR THE COMPUTATION OF DISCRETE COSINE AND SINE TRANSFORMS

Z CVETKOVIC; MV POPOVIC

doi:10.1109/78.150010

NEW FAST RECURSIVE ALGORITHMS FOR THE COMPUTATION OF DISCRETE COSINE AND SINE TRANSFORMS

Z CVETKOVIC^*, MV POPOVIC

^*Corresponding author for this work

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

59 Citations (Scopus)

Abstract

In this correspondence, new fast recursive algorithms for the computation of the discrete cosine and sine transforms are developed. An N-point DCT or DST can be computed from two N/2-point DCT's or DST's. Compared to the existing algorithms the new algorithms have less multiplications by 2, and add operations are better positioned giving rise to faster computation and easier VLSI implementation.

Original language	English
Pages (from-to)	2083-2086
Number of pages	4
Journal	IEEE Transactions on Signal Processing
Volume	40
Issue number	8
DOIs	https://doi.org/10.1109/78.150010
Publication status	Published - Aug 1992

Access to Document

10.1109/78.150010

Cite this

@article{3f15bd59b74b4ffc8a9d1cd09728550b,

title = "NEW FAST RECURSIVE ALGORITHMS FOR THE COMPUTATION OF DISCRETE COSINE AND SINE TRANSFORMS",

abstract = "In this correspondence, new fast recursive algorithms for the computation of the discrete cosine and sine transforms are developed. An N-point DCT or DST can be computed from two N/2-point DCT's or DST's. Compared to the existing algorithms the new algorithms have less multiplications by 2, and add operations are better positioned giving rise to faster computation and easier VLSI implementation.",

author = "Z CVETKOVIC and MV POPOVIC",

year = "1992",

month = aug,

doi = "10.1109/78.150010",

language = "English",

volume = "40",

pages = "2083--2086",

journal = "IEEE Transactions on Signal Processing",

issn = "1053-587X",

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

number = "8",

}

TY - JOUR

T1 - NEW FAST RECURSIVE ALGORITHMS FOR THE COMPUTATION OF DISCRETE COSINE AND SINE TRANSFORMS

AU - CVETKOVIC, Z

AU - POPOVIC, MV

PY - 1992/8

Y1 - 1992/8

N2 - In this correspondence, new fast recursive algorithms for the computation of the discrete cosine and sine transforms are developed. An N-point DCT or DST can be computed from two N/2-point DCT's or DST's. Compared to the existing algorithms the new algorithms have less multiplications by 2, and add operations are better positioned giving rise to faster computation and easier VLSI implementation.

AB - In this correspondence, new fast recursive algorithms for the computation of the discrete cosine and sine transforms are developed. An N-point DCT or DST can be computed from two N/2-point DCT's or DST's. Compared to the existing algorithms the new algorithms have less multiplications by 2, and add operations are better positioned giving rise to faster computation and easier VLSI implementation.

U2 - 10.1109/78.150010

DO - 10.1109/78.150010

M3 - Letter

SN - 1053-587X

VL - 40

SP - 2083

EP - 2086

JO - IEEE Transactions on Signal Processing

JF - IEEE Transactions on Signal Processing

IS - 8

ER -

NEW FAST RECURSIVE ALGORITHMS FOR THE COMPUTATION OF DISCRETE COSINE AND SINE TRANSFORMS

Abstract

Access to Document

Fingerprint

Cite this