[[abstract]]The authors consider two over-the-cell channel routing problems: the over-the-cell planar routing problem and the over-the-cell net assignment problem. They present optimal algorithms for solving the two problems. Experimental results are also provided to demonstrate the efficiency and effectiveness of the algorithms[[fileno]]2030229030032[[department]]資訊工程學
[[abstract]]©1991 IEEE-An approach for reducing the density of a channel by routing some nets (or su...
[[abstract]]An approach for reducing the density of a channel by routing some nets (or subnets) over...
We show that any n-net 2-terminal channel routing problem of density d can be wired on a two-layer g...
[[abstract]]A new cell model was recently introduced by B. Wu et al (Over-the-Cell Routers for New C...
Abstract: The first stage of over-the-cell routing in the horizontally connected vertically connecte...
[[abstract]]We study in this paper a new channel pin assignment problem for the new cell model in wh...
[[abstract]]A linear time algorithm for routing over the cells is presented. The algorithm tries to ...
Abstract: The authors present a new algorithm for both two-layer and three-layer over-the-cell chann...
[[abstract]]We study in this paper the net assignment problem subject to the capacity constraint, se...
[[abstract]]An approach for reducing the density of a channel by routing some nets (or subnets) over...
[[abstract]]An algorithm known as optimal channel routing (OCR) is proposed which finds an optimal s...
[[abstract]]An algorithm known as optimal channel routing (OCR) is proposed which finds an optimal s...
[[abstract]]An approach for reducing the density of a channel by routing some nets (or subnets) over...
In this thesis, we solve several important routing problems in the physical design of VLSI circuits....
In this thesis, we solve several important routing problems in the physical design of VLSI circuits....
[[abstract]]©1991 IEEE-An approach for reducing the density of a channel by routing some nets (or su...
[[abstract]]An approach for reducing the density of a channel by routing some nets (or subnets) over...
We show that any n-net 2-terminal channel routing problem of density d can be wired on a two-layer g...
[[abstract]]A new cell model was recently introduced by B. Wu et al (Over-the-Cell Routers for New C...
Abstract: The first stage of over-the-cell routing in the horizontally connected vertically connecte...
[[abstract]]We study in this paper a new channel pin assignment problem for the new cell model in wh...
[[abstract]]A linear time algorithm for routing over the cells is presented. The algorithm tries to ...
Abstract: The authors present a new algorithm for both two-layer and three-layer over-the-cell chann...
[[abstract]]We study in this paper the net assignment problem subject to the capacity constraint, se...
[[abstract]]An approach for reducing the density of a channel by routing some nets (or subnets) over...
[[abstract]]An algorithm known as optimal channel routing (OCR) is proposed which finds an optimal s...
[[abstract]]An algorithm known as optimal channel routing (OCR) is proposed which finds an optimal s...
[[abstract]]An approach for reducing the density of a channel by routing some nets (or subnets) over...
In this thesis, we solve several important routing problems in the physical design of VLSI circuits....
In this thesis, we solve several important routing problems in the physical design of VLSI circuits....
[[abstract]]©1991 IEEE-An approach for reducing the density of a channel by routing some nets (or su...
[[abstract]]An approach for reducing the density of a channel by routing some nets (or subnets) over...
We show that any n-net 2-terminal channel routing problem of density d can be wired on a two-layer g...
DOI
Add to ORKG