Minimum Separation for Single-Layer Channel Routing

Ronald I. Greenberg; F. Miller Maley

doi:10.1016/0020-0190(92)90201-6

Minimum Separation for Single-Layer Channel Routing

Ronald I. Greenberg, F. Miller Maley

Department of Computer Science

Research output: Contribution to journal › Article › peer-review

Abstract

We present a linear-time algorithm for determining the minimum height of a single-layer routing channel. The algorithm handles single-sided connections and multiterminal nets. It yields a simple routability test for single-layer switchboxes, correcting an error in the literature.

Original language	American English
Journal	Computer Science: Faculty Publications and Other Works
Volume	43
Issue number	4
DOIs	https://doi.org/10.1016/0020-0190(92)90201-6
State	Published - Sep 1 1992

Keywords

Algorithms
channel routing
river routing
routability
VLSI layout

Disciplines

Computer Sciences
VLSI and Circuits, Embedded and Hardware Systems

Access to Document

10.1016/0020-0190(92)90201-6License: Unspecified

Minimum Separation for Single-Layer Channel RoutingFinal published version, 355 KBLicense: Unspecified

Cite this

@article{50864f74b7ab452a98d0911dde3e0475,

title = "Minimum Separation for Single-Layer Channel Routing",

abstract = " We present a linear-time algorithm for determining the minimum height of a single-layer routing channel. The algorithm handles single-sided connections and multiterminal nets. It yields a simple routability test for single-layer switchboxes, correcting an error in the literature.",

keywords = "Algorithms, channel routing, river routing, routability, VLSI layout",

author = "Greenberg, {Ronald I.} and Maley, {F. Miller}",

year = "1992",

month = sep,

day = "1",

doi = "10.1016/0020-0190(92)90201-6",

language = "American English",

volume = "43",

journal = "Computer Science: Faculty Publications and Other Works",

number = "4",

}

TY - JOUR

T1 - Minimum Separation for Single-Layer Channel Routing

AU - Greenberg, Ronald I.

AU - Maley, F. Miller

PY - 1992/9/1

Y1 - 1992/9/1

N2 - We present a linear-time algorithm for determining the minimum height of a single-layer routing channel. The algorithm handles single-sided connections and multiterminal nets. It yields a simple routability test for single-layer switchboxes, correcting an error in the literature.

AB - We present a linear-time algorithm for determining the minimum height of a single-layer routing channel. The algorithm handles single-sided connections and multiterminal nets. It yields a simple routability test for single-layer switchboxes, correcting an error in the literature.

KW - Algorithms

KW - channel routing

KW - river routing

KW - routability

KW - VLSI layout

UR - https://ecommons.luc.edu/cs_facpubs/115

U2 - 10.1016/0020-0190(92)90201-6

DO - 10.1016/0020-0190(92)90201-6

M3 - Article

VL - 43

JO - Computer Science: Faculty Publications and Other Works

JF - Computer Science: Faculty Publications and Other Works

IS - 4

ER -

Minimum Separation for Single-Layer Channel Routing

Abstract

Keywords

Disciplines

Access to Document

Other files and links

Cite this