Although the undeniable importance of high quality, efficient and effective DSP synthesis benchmark has been firmly and widely established, until now the emphasis of benchmarking has been restricted on assembling individual examples. In this paper we introduce the "ideal candidate benchmark methodology" which poses the development of the benchmark as well as defines a statistical and optimization problem. We first outline the goals and requirements relevant for the benchmark development. After discussing the computational complexity of the benchmark selection problem, we present a simulated annealing-based algorithm for solving this computationally intractable optimization task. Using this approach from 150 examples we select 12 examples for the new DSP Quant benchmark for DSP hard Real-Time applications. The DSP benchmark is statistically validated, and its application to the analysis and development of system-level synthesis algorithms is demonstrated,.
[1]
Miodrag Potkonjak,et al.
System-level design guidance using algorithm properties
,
1994,
Proceedings of 1994 IEEE Workshop on VLSI Signal Processing.
[2]
Robert Tibshirani,et al.
An Introduction to the Bootstrap
,
1994
.
[3]
C. D. Gelatt,et al.
Optimization by Simulated Annealing
,
1983,
Science.
[4]
H. Kuhn.
The Hungarian method for the assignment problem
,
1955
.
[5]
Franc Brglez,et al.
A D&T Special Report on ACM/SIGDA Design Automation Benchmarks: Catalyst or Anathema?
,
1993,
IEEE Des. Test Comput..
[6]
David Bryan,et al.
Combinational profiles of sequential benchmark circuits
,
1989,
IEEE International Symposium on Circuits and Systems,.
[7]
Michael Randolph Garey,et al.
Johnson: "computers and intractability
,
1979
.