Testing the <I>k</I>-Layer Routability in a Circular Channel--Case in which No Nets Have Two Terminals on the Same Circle--

Noriya KOBAYASHI; Toshinobu KASHIWABARA; Sumio MASUDA

Testing the k-Layer Routability in a Circular Channel--Case in which No Nets Have Two Terminals on the Same Circle--

Noriya KOBAYASHI, Toshinobu KASHIWABARA, Sumio MASUDA

Full Text Views

0

Share
Cite this

Summary :

Suppose that there are terminals on two concentric circles, C_in and C_out, with C_in inside of C_out. We are given a set of nets each of which consists of a terminal on C_in and a terminal on C_out. The routing area is the annular region between the two circles. In this paper, we present an O(n^k-1) time algorithm for testing whether the given net set is k-layer routable without vias, where k2 and n is the number of nets.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E75-A No.2 pp.233-239

Publication Date: 1992/02/25

Publicized

Online ISSN

DOI

Type of Manuscript: PAPER

Category: Computer Aided Design (CAD)

Cite this

Copy

Noriya KOBAYASHI, Toshinobu KASHIWABARA, Sumio MASUDA, "Testing the k-Layer Routability in a Circular Channel--Case in which No Nets Have Two Terminals on the Same Circle--" in IEICE TRANSACTIONS on Fundamentals, vol. E75-A, no. 2, pp. 233-239, February 1992, doi: .
Abstract: Suppose that there are terminals on two concentric circles, C_in and C_out, with C_in inside of C_out. We are given a set of nets each of which consists of a terminal on C_in and a terminal on C_out. The routing area is the annular region between the two circles. In this paper, we present an O(n^k-1) time algorithm for testing whether the given net set is k-layer routable without vias, where k2 and n is the number of nets.
URL: https://globals.ieice.org/en_transactions/fundamentals/10.1587/e75-a_2_233/_p

Copy

@ARTICLE{e75-a_2_233,
author={Noriya KOBAYASHI, Toshinobu KASHIWABARA, Sumio MASUDA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Testing the k-Layer Routability in a Circular Channel--Case in which No Nets Have Two Terminals on the Same Circle--},
year={1992},
volume={E75-A},
number={2},
pages={233-239},
abstract={Suppose that there are terminals on two concentric circles, C_in and C_out, with C_in inside of C_out. We are given a set of nets each of which consists of a terminal on C_in and a terminal on C_out. The routing area is the annular region between the two circles. In this paper, we present an O(n^k-1) time algorithm for testing whether the given net set is k-layer routable without vias, where k2 and n is the number of nets.},
keywords={},
doi={},
ISSN={},
month={February},}

Copy

TY - JOUR
TI - Testing the k-Layer Routability in a Circular Channel--Case in which No Nets Have Two Terminals on the Same Circle--
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 233
EP - 239
AU - Noriya KOBAYASHI
AU - Toshinobu KASHIWABARA
AU - Sumio MASUDA
PY - 1992
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E75-A
IS - 2
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - February 1992
AB - Suppose that there are terminals on two concentric circles, C_in and C_out, with C_in inside of C_out. We are given a set of nets each of which consists of a terminal on C_in and a terminal on C_out. The routing area is the annular region between the two circles. In this paper, we present an O(n^k-1) time algorithm for testing whether the given net set is k-layer routable without vias, where k2 and n is the number of nets.
ER -