Condensed recursive structures for discrete cosine transform

Chih Peng Fan, Jar-Ferr Yang

Research output: Contribution to journalArticle

Abstract

In this paper, we propose condensed recursive structures for competing type-two discrete cosine transforms with arbitrary transform length. Based on preaddition and permutation of original input data, the proposed recursive algorithms with fixed computation kernels need fewer recursive loops than the previous methods when the transformed length is not a prime number. In finite length machines, we found that properly selected filter coefficients achieve low round-off errors in their transformations. Furthermore, the proposed structures save computational complexity in the realization of recursive filters, which usually need general multipliers and memory to store total variable filter coefficients.

Original languageEnglish
Number of pages1
JournalIEEE Transactions on Signal Processing
Volume46
Issue number7
Publication statusPublished - 1998 Dec 1

    Fingerprint

All Science Journal Classification (ASJC) codes

  • Signal Processing
  • Electrical and Electronic Engineering

Cite this