Design space exploration using the genetic algorithm
Henrik Esbensen, E.S. Kuh · IEEE International Symposium on Circuits and Systems proceedings · 1996
A typical VLSI layout problem involves the simultaneous optimization of a number of competing criteria. Rather than generating a single compromise solution, some recent approaches explicitly explores the design space and outputs a set of alternative solutions, thereby providing explicit information on the possible tradeoffs. This paper discuss the use of genetic algorithms (GAs) for design space exploration and propose a solution set quality measure needed to evaluate the performance of set-generating algorithms. A GA for building-block placement is evaluated using the proposed measure and promising results are obtained.
Cited by 46 works. doi:10.1109/iscas.1996.542010
Authors
References
- An Overview of Evolutionary Algorithms in Multiobjective Optimization
- GENETIC ALGORITHMS FOR MULTI-OBJECTIVE OPTIMIZATION: FORMULATION, DISCUSSION, AND GENERALIZATION
- On area/depth trade-off in LUT-based FPGA technology mapping
- Optimal wire sizing and buffer insertion for low power and a generalized delay model
- Optimal wire sizing and buffer insertion for low power and a generalized delay model
- An MCM/IC timing-driven placement algorithm featuring explicit design space exploration
- Multiobjective search in VLSI design
- The design of hybrid fuzzy/evolutionary multiobjective optimization algorithms