Proceedings 2000. Design Automation Conference. (IEEE Cat. No.00CH37106)
DOI: 10.1109/aspdac.2000.835110
|View full text |Cite
|
Sign up to set email alerts
|

Dynamic weighting Monte Carlo for constrained floorplan designs in mixed signal application

Abstract: Simulated annealing has been one of the most popular stochastic optimization methods used in the VLSI CAD eld in the past two decades. Recently, a new Monte Carlo and optimization method, named dynamic weighting Monte Carlo WL97 , has been introduced and successfully applied to the traveling salesman problem, neural network training WL97 , and spin-glasses simulation LW99 . In this paper, we h a v e successfully applied dynamic weighting Monte Carlo algorithm to the constrained oorplan design with consideratio… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(3 citation statements)
references
References 21 publications
0
3
0
Order By: Relevance
“…Recently proposed automated analog cell generation [12] and placement tools [13][14][15] are driven by geometric constraints. Parasitic considerations are ignored until postextraction.…”
Section: Performance-driven Layout Optimizationmentioning
confidence: 99%
See 1 more Smart Citation
“…Recently proposed automated analog cell generation [12] and placement tools [13][14][15] are driven by geometric constraints. Parasitic considerations are ignored until postextraction.…”
Section: Performance-driven Layout Optimizationmentioning
confidence: 99%
“…Empirical optimizers based on evolutionary and annealing-based optimization schemes are often used to efficiently cover non-linear performance spaces efficiently. In [14], random placement candidates are generated. The best candidates determined by some objective functions are saved.…”
Section: Performance-driven Layout Optimizationmentioning
confidence: 99%
“…In [5], random placement candidates are generated. The best candidates determined by some objective functions are saved.…”
Section: Topological Placement Optimizationmentioning
confidence: 99%