IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · 1992 · 11 citations · 13 references
EngineeringCombinatorial DesignAutomatic CompactionComputer-aided DesignStructural OptimizationConstraint ProgrammingPhysical Design (Electronics)Geometric Constraint SolvingConditional Design RulesDiscrete MathematicsCombinatorial OptimizationComputational GeometryConditional Spacing RulesGeometric ModelingBlock DesignDesignComputer EngineeringComputer ScienceConditional Spacing RuleInteger ProgrammingTopology OptimizationArchitectural DesignGraph TheoryNatural SciencesFormal MethodsStructural TopologyArchitectural Geometry
The compaction of IC layouts subjected to conditional spacing rules in multiple-level metal technology is addressed. The constraints imposed by conditional rules make the automatic compaction of layout much more difficult than when the usual minimum separation rules are applied. To solve the problem, each conditional spacing rule is formulated with a set of arcs in the constraint graph representation. It is proven that finding the optimal solution under one bridge rule is NP-complete. A graph-theory method of compaction which, by reducing the problem size, can efficiently obtain an optimal solution is proposed.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
13
Optimal layout via Boolean satisfiability
Srinivas Devadas · 2003 · 87 citations
Mathematical Programming, Circuit Complexity, Optimal Layout +17
Symbolic layout compaction review
D.G. Boyer · Design Automation Conference · 1988 · 82 citations