A comrade-matrix-based derivation of the different versions of fast cosine and sine transforms

Alexander Olshevsky, Vadim Olshevsky, Jun Wang

Research output: Contribution to journalConference article

Abstract

The paper provides a fully self-contained derivation of fast algorithms to compute discrete Cosine and Sine transforms I - II based on the concept of the comrade matrix. The comrade matrices associated with different versions of the transforms differ in only a few boundary elements; hence, in each case algorithms can be derived in a unified manner.

Original languageEnglish (US)
Pages (from-to)399-410
Number of pages12
JournalProceedings of SPIE - The International Society for Optical Engineering
Volume5205
DOIs
StatePublished - 2003
EventAdvanced Signal Processing Algorithms, Architectures, and Implementations - San Diego, USA, United States
Duration: Aug 6 2003Aug 8 2003

Keywords

  • Comrade matrix
  • Discrete cosine transform
  • Discrete sine transform
  • Fast fourier transform

ASJC Scopus subject areas

  • Electronic, Optical and Magnetic Materials
  • Condensed Matter Physics
  • Computer Science Applications
  • Applied Mathematics
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'A comrade-matrix-based derivation of the different versions of fast cosine and sine transforms'. Together they form a unique fingerprint.

  • Cite this