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  

Publication
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E75-A   No.2   pp.233-239
Publication Date: 1992/02/25
Online ISSN: 
DOI: 
Print ISSN: 0916-8508
Type of Manuscript: PAPER
Category: Computer Aided Design (CAD)
Keyword: 
algorithm,  routing,  via minimization,  layer assignment,  

Full Text: PDF(472.1KB)>>
Buy this Article




Summary: 
Suppose that there are terminals on two concentric circles, Cin and Cout, with Cin inside of Cout. We are given a set of nets each of which consists of a terminal on Cin and a terminal on Cout. The routing area is the annular region between the two circles. In this paper, we present an O(nk-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.