Algorithm for p[sup m]-length discrete cosine transform

Yuk Hee Chan, W.C. Siu

Research output: Chapter in book / Conference proceedingConference article published in proceeding or bookAcademic research

Abstract

A new algorithm is introduced such that we can realize a discrete cosine transform by correlations. This algorithm can be applied to any p[sup m]-length DCT, where p is an odd prime, and is most suitable for VLSI implementation.
Original languageEnglish
Title of host publication[Missing Source Name from PIRA]
PublisherIEEE
ISBN (Print)0780300505
Publication statusPublished - 1991

Keywords

  • VLSI
  • Digital arithmetic
  • Transforms

Fingerprint

Dive into the research topics of 'Algorithm for p[sup m]-length discrete cosine transform'. Together they form a unique fingerprint.

Cite this