Methodology for behavioral synthesis-based algorithm-level design space exploration: DCT case study

Miodrag Potkonjak, Kyosun Kim, Ramesh Karri

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Numerous fast algorithms for the Discrete Cosine Transform (DCT) have been proposed. Until recently, it has been difficult to compare different DCT algorithms and select one which is best suited for implementation under a given set of design goals. We propose an approach for design space exploration at the algorithm and behavioral levels using behavioral synthesis tools and demonstrate its effectiveness for designing DCT ASIC. In particular, we study and compare the following nine DCT algorithms: Lee's, Wang's, DIT, DFT, Arai's, DIF, Vetterli's, planar rotation, and direct algorithm. The main conclusions of this study are (i) the best choice among fast DCT algorithms depends on a particular set of design goals and constraints and (ii) almost always more than an order of magnitude improvement can be achieved using algorithm and behavioral design space exploration.

Original languageEnglish (US)
Title of host publicationProceedings - Design Automation Conference
PublisherIEEE
Pages252-257
Number of pages6
StatePublished - 1997
EventProceedings of the 1997 34th Design Automation Conference - Anaheim, CA, USA
Duration: Jun 9 1997Jun 13 1997

Other

OtherProceedings of the 1997 34th Design Automation Conference
CityAnaheim, CA, USA
Period6/9/976/13/97

ASJC Scopus subject areas

  • Hardware and Architecture
  • Control and Systems Engineering

Fingerprint Dive into the research topics of 'Methodology for behavioral synthesis-based algorithm-level design space exploration: DCT case study'. Together they form a unique fingerprint.

Cite this