Methodology for Behavioral Synthesis-Based Algorithm-Level Design Space Exploration: DCT Case Study

: Numerous fast algorithms for the Discrete Cosine Transform DCT have been proposed. Until recently, it has been di cult to compare di erent 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 e ectiveness 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.

• Type: Conference
• Year: 1997
• Where: DAC
• Authors: Miodrag Potkonjak, Kyosun Kim, Ramesh Karri
• Keywords: Computer Architecture, DAC 1997, DCT Algorithms, Design Space Exploration, Erent Dct Algorithms