ISPD
2000
ACM
13 years 9 months ago
2000
ACM
modules can be handled in constraint graphs efficiently. This Floorplan area minimization is an important problem because many modules have shape flexibilities during the floorplan...
ISPD
2000
ACM
13 years 9 months ago
2000
ACM
The standard cell placement problem has been extensively studied in the past twenty years. Many approaches were proposed and proven e ective in practice. However, successful place...
ISPD
2000
ACM
13 years 9 months ago
2000
ACM
As technology advances, more and more issues need to be considered in the placement stage, e.g., wirelength, congestion, timing, coupling. It is very hard to consider all of them ...
ISPD
2000
ACM
13 years 9 months ago
2000
ACM
In this paper, we propose a new clock tree synthesis method for semi-synchronous circuits. A clock tree obtained by the proposed method is a multi-level multi-way clock tree such ...
ISPD
2000
ACM
13 years 9 months ago
2000
ACM
We address the problem of computing critical area for missing material defects in a circuit layout. The extraction of critical area is the main computational problem in VLSI yield...
ISPD
2000
ACM
13 years 9 months ago
2000
ACM
Recently, a deterministic algorithm based on the O-tree representation has been proposed. This method generates excellent layout results on MCNC test cases with O(n3 ) complexity,...
ISPD
2000
ACM
13 years 9 months ago
2000
ACM
ÁÒ Ø × Ô Ô Ö¸ Û ÔÖ × ÒØ Ò ÔØ Ø ÓÒ ÓÖ ÝÔ Ö Ö Ô Ô Ö¹ Ø Ø ÓÒ Ò Ó Ø ÑÙÐØ Ð Ú Ð ÓÓÔ Ö Ø Ú × Ö Ô Ö Ñ ¬Ö×Ø ÒØÖÓ Ù Ý ÌÓ...
ISPD
2000
ACM
13 years 9 months ago
2000
ACM
ISPD
2000
ACM
13 years 9 months ago
2000
ACM
In this paper we present a repeater block planning algorithm for interconnect-centric floorplanning. We introduce the concept of independent feasible regions for repeaters and der...
ISPD
2000
ACM
13 years 9 months ago
2000
ACM
