Results 1 
3 of
3
An efficient approach to multilayer layer assignment with an application to via minimization
 National Taiwan University
, 1999
"... Abstract—In this paper we present an efficient heuristic algorithm for the postlayout layer assignment and via minimization £ problem of multilayer gridless integrated circuit (IC), printed ¤ circuit board (PCB), and multichip module (MCM) layouts. We formulate the multilayer layer assignment probl ..."
Abstract

Cited by 12 (0 self)
 Add to MetaCart
Abstract—In this paper we present an efficient heuristic algorithm for the postlayout layer assignment and via minimization £ problem of multilayer gridless integrated circuit (IC), printed ¤ circuit board (PCB), and multichip module (MCM) layouts. We formulate the multilayer layer assignment problem by introducing the notion of the extended conflictcontinuation (ECC) graph. When the formulated ECC graph of a layer assignment problem is a tree, we show that the problem can be solved by an algorithm § which is both linear time and optimal. When the formulated ECC ¨graph is not a tree, we present an algorithm which constructs © a sequence of maximal induced subtrees from the ECC graph, then applies our linear time optimal algorithm to each of the induced subtrees to refine the layer assignment. Our experiments
On the kLayer Planar Subset and Topological Via Minimization Problems
 IEEE Transactions on ComputerAided Design of Integrated Circuits and Systems
, 1991
"... An important problem in performancedriven routing is the k layer planar subset problem which is to choose a maximum (weighted) subset of nets such that each net in the subset can be routed in one of k "preferred" layers. Related to the k layer planar subset problem is the k layer topol ..."
Abstract

Cited by 8 (4 self)
 Add to MetaCart
(Show Context)
An important problem in performancedriven routing is the k layer planar subset problem which is to choose a maximum (weighted) subset of nets such that each net in the subset can be routed in one of k "preferred" layers. Related to the k layer planar subset problem is the k layer topological viaminimization problem which is to determine the topology of each net using k routing layers such that a minimum number of vias is used. For the case k = 2, the topological via minimization problem has been studied by CAD researchers for a long time because of its practical and theoretical importance. In this paper, we show that both the general k layer planar subset problem and the k layer topological via minimization problem are NPcomplete. Moreover, we show that both problems can be solved in polynomial time when the routing regions are crossing channels. It can be shown that under a suitable assumption, all the channels for interblock connections in the general cell design style are ...
THE RETIMING AND ROUTING OF VLSI CIRCUITS
, 1998
"... In this thesis, we explore three problems arising during the logic synthesis and physical design stages of VLSI circuit design. We rst present a new formulation for the retiming of singlephase clocked circuits containing latches. Then, we discuss crosstalk optimization in channelbased routings, a ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
In this thesis, we explore three problems arising during the logic synthesis and physical design stages of VLSI circuit design. We rst present a new formulation for the retiming of singlephase clocked circuits containing latches. Then, we discuss crosstalk optimization in channelbased routings, and nally present a new performancedriven algorithm for the layer assignment of critical global nets. Although singlephase clocked circuits containing latches are in widespread use, there is no existing practical formulation for such circuits that allows retimingbased optimizations. We present anovel, ILPbased formulation for the retiming of such circuits. This formulation can be used to optimize any linearizable objective function. As examples, we discuss the optimization of the clock period and the area of such circuits. Our experiments demonstrate that our approach ise cient and generates ILPs that are easy to solve. We address the increased importance of crosstalk avoidance in deep sub