Efficient formulation for the realization of Discrete Cosine Transform using recursive structure

Lap Pui Chau, Wan Chi Siu

Research output: Journal article publicationConference articleAcademic researchpeer-review

4 Citations (Scopus)

Abstract

Effective formulations for the conversion of the Discrete Fourier Transform (DFT) into recursive structure are available and have been found very effective for the realization using software, hardware and VLSI techniques. Little research work has been reported on the effective way to convert the Discrete Cosine Transform (DCT) into recursive form and the related realization. In this paper, we propose a new method to convert a prime length DCT into a recursive structure. A trivial approach is to convert the DCT into DFT and to apply Goertzel's algorithm for the rest of the realization. However, this method is inefficient. In our approach, we convert a prime length DCT into suitable transforms with half of the original length to effect fast realization. The number of operations is greatly reduced and the structure is extremely regular.

Original languageEnglish
Article number389996
Pages (from-to)III4437-III440
JournalICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings
Volume3
DOIs
Publication statusPublished - Apr 1994
EventProceedings of the 1994 IEEE International Conference on Acoustics, Speech and Signal Processing. Part 2 (of 6) - Adelaide, Aust
Duration: 19 Apr 199422 Apr 1994

ASJC Scopus subject areas

  • Software
  • Signal Processing
  • Electrical and Electronic Engineering

Fingerprint

Dive into the research topics of 'Efficient formulation for the realization of Discrete Cosine Transform using recursive structure'. Together they form a unique fingerprint.

Cite this