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

Authors:
Miodrag Potkonjak;Kyosun Kim;Ramesh Karri
Affiliations:
Department of Computer Science, University of California, Los Angeles, CA;Department of Electrical and Computer Engineering, University of Massachusetts, Amherst, MA;Department of Electrical and Computer Engineering, University of Massachusetts, Amherst, MA
Venue:
DAC '97 Proceedings of the 34th annual Design Automation Conference
Year:
1997

Citing 6
Cited 1

A comparison of fast inverse discrete cosine transform algorithms

Multimedia Systems - Special issue on video compression
Strategies for design automation of high speed digital filters

Journal of VLSI Signal Processing Systems - Special issue on design environments for DSP
Synthesis of pipelined DSP accelerators with dynamic scheduling

ISSS '95 Proceedings of the 8th international symposium on System synthesis
Anatomy of a Silicon Compiler

Anatomy of a Silicon Compiler
Fast Prototyping of Datapath-Intensive Architectures

IEEE Design & Test
Synthesis and selection of DCT algorithms using behavioral synthesis-based algorithm space exploration

ICIP '95 Proceedings of the 1995 International Conference on Image Processing (Vol. 1)-Volume 1 - Volume 1

Algorithm and architecture-level design space exploration using hierarchical data flows

ASAP '97 Proceedings of the IEEE International Conference on Application-Specific Systems, Architectures and Processors

Quantified Score

Hi-index	0.00

Visualization

Abstract

Numerous fast algorithms for the DiscreteCosine Transform (DCT) have been proposed. Until recently, it has been difficult to compare different DCT algorithms and select one which is best suitedfor implementation under a given set of design goals.We propose an approach for design space explorationat the algorithm and behavioral levels using behavioral synthesis tools and demonstrate its effectiveness for designing DCT ASIC. In particular, we study andcompare 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 anorder of magnitude improvement can be achieved using algorithm and behavioral design space exploration.