| Yield-area optimizations of digital circuits using non-dominated sorting genetic algorithm (YOGA) |
| Full text |
Pdf
(281 KB)
|
| Source
|
Asia and South Pacific Design Automation Conference
archive
Proceedings of the 2006 Asia and South Pacific Design Automation Conference
table of contents
Yokohama, Japan
SESSION: Statistical and yield analysis
table of contents
Pages: 718 - 723
Year of Publication: 2006
ISBN:0-7803-9451-8
|
|
Authors
|
|
| Sponsors |
|
| Publisher |
IEEE Press
Piscataway, NJ, USA
|
| Bibliometrics |
Downloads (6 Weeks): 4, Downloads (12 Months): 19, Citation Count: 0
|
|
|
ABSTRACT
With shrinking technology, the timing variation of a digital circuit is becoming the most important factor while designing a functionally reliable circuit. Gate sizing has emerged as one of the efficient way to subside the yield deterioration due to manufacturing variations. In the past single-objective optimization techniques have been used to optimize the timing variation whereas on the other hand multi-objective optimization techniques can provide a more promising approach to design the circuit. We propose a new algorithm called YOGA, based on multi-objective optimization technique called Non-dominated Sorting Genetic Algorithm (NSGA). YOGA optimizes a circuit in multi domains and provides the user with Pareto-optimal set of solutions which are distributed all over the optimal design spectrum, giving users the flexibility to choose the best fitting solution for their requirements. YOGA overcomes the disadvantages of traditional optimization techniques, while even providing solutions in very stringent bounds.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
 |
1
|
|
 |
2
|
|
| |
3
|
|
 |
4
|
Jaskirat Singh , Vidyasagar Nookala , Zhi-Quan Luo , Sachin Sapatnekar, Robust gate sizing by geometric programming, Proceedings of the 42nd annual conference on Design automation, June 13-17, 2005, San Diego, California, USA
[doi> 10.1145/1065579.1065662]
|
| |
5
|
|
| |
6
|
M. Pan, C. C. N. Chu, and H. Zhou, "Timing yield estimation using statistical static timing analysis," in Intl Symposium on Circuits and Systems, 2005.
|
| |
7
|
|
 |
8
|
|
| |
9
|
|
| |
10
|
N. Srinivas and K. Deb, "Multi-objective function optimization using non-dominated sorting genetic algorithms," in Evolutionary Computation, 1994.
|
| |
11
|
A. G. Cunha, P. Oliveira, and J. A. Covas, "Use of genetic algorithms in multicriteria optimization to solve industrial problems," in Proceedings of the Seventh International Conference on Genetic Algorithms, 1997, pp. 682--688.
|
| |
12
|
|
| |
13
|
K. Deb, "Non-linear goal programming using multi-objective genetic algorithms," Evolutionary Computation Journal, 1994.
|
| |
14
|
|
 |
15
|
Jing-Jia Liou , Kwang-Ting Cheng , Sandip Kundu , Angela Krstic, Fast statistical timing analysis by probabilistic event propagation, Proceedings of the 38th conference on Design automation, p.661-666, June 2001, Las Vegas, Nevada, United States
[doi> 10.1145/378239.379043]
|
| |
16
|
C. Clark, "The greatest of a finite set of random variables," Operations Research, vol. 9, no. 2, 1961.
|
| |
17
|
|
| |
18
|
"Berkeley ptm." {Online}. Available: http://www-device.eecs.berkeley.edu/~ptm/
|
|