A generalized fast algorithm for n-D discrete cosine transform and its application to motion picture coding

Zhishun Wang, Zhenya He, Cairong Zou, J. D.Z. Chen

Research output: Contribution to journalArticlepeer-review

Abstract

In this paper, a generalized fast computational algorithm for the n -dimensional discrete cosine transform (DCT) of length N = 2m (m > 2) is presented. The developed algorithm is proved and its efficiency is evaluated theoretically. The theoretical results show that compared with the conventional method of computing the one-dimensional along n directions, the number of multiplications needed by our algorithm is only 1/n of that required by the conventional method; for the total number of additions, the latter is a bit more when N < 8 and much fewer when N > 16 than the former. To validate the proposed algorithm, we take the case when n -3 as an example and apply it to motion-picture coding. The results show that our method is superior to MPEG-2 in speed and coding performance. The algorithm is clearly described and it is easy to make a computer program for implementation.

Original languageEnglish (US)
Pages (from-to)617-627
Number of pages11
JournalIEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing
Volume46
Issue number5
DOIs
StatePublished - Dec 1 1999
Externally publishedYes

Keywords

  • Discrete cosine transform (dct)
  • Fast algorithm
  • MPEG
  • Motion picture coding
  • Multidimensional signal processing

ASJC Scopus subject areas

  • Signal Processing
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'A generalized fast algorithm for n-D discrete cosine transform and its application to motion picture coding'. Together they form a unique fingerprint.

Cite this