Cell placement is an important phase of current VLSI circuit design styles such as standard cell, gate array, and Field Programmable Gate Array (FPGA). Although nondeterministic algorithms such as Simulated Annealing (SA) were successful in solving this problem, they are known to be slow. In this pa
β¦ LIBER β¦
Placement algorithms for custom VLSI
β Scribed by Kenneth J. Supowit; Eric A. Slutz
- Publisher
- Elsevier Science
- Year
- 1984
- Tongue
- English
- Weight
- 638 KB
- Volume
- 16
- Category
- Article
- ISSN
- 0010-4485
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
A fast neural-network algorithm for VLSI
β
Cevdet Aykanat; Tevfik Bultan; Δ°smail HaritaoΔlu
π
Article
π
1998
π
Elsevier Science
π
English
β 423 KB
Statistical analysis of parallel randomi
β
Kemal Efe
π
Article
π
1995
π
Elsevier Science
π
English
β 825 KB
Optimal placement for hierarchical VLSI
β
M. Mir; M.H. Imam
π
Article
π
1989
π
Elsevier Science
β 360 KB
Placement Algorithms for Hierarchical Co
β
Madhukar R Korupolu; C.Greg Plaxton; Rajmohan Rajaraman
π
Article
π
2001
π
Elsevier Science
π
English
β 286 KB
Consider a hierarchical network in which each node periodically issues a request for an object drawn from a fixed set of unit-size objects. Suppose further that the following conditions are satisfied: the frequency with which each node accesses each object is known; each node has a cache of known ca
Parallel Algorithms for VLSI Layout Veri
β
Ky MacPherson; Prithviraj Banerjee
π
Article
π
1996
π
Elsevier Science
π
English
β 335 KB
Algorithms and tools for VLSI design
β
Lec JΓ³ΕΊwiak
π
Article
π
1993
π
Elsevier Science
β 184 KB