IMPROVED LEFT EDGE CHANNEL ROUTER.

Takeshi Yoshimura

Research output: Contribution to journalArticle

Abstract

A new channel routing algorithm is presented which is not only simple and fast, but also highly effective. It assumes that pins and wires lie on a common grid in a two layer channel, and that vertical wires are on one layer, horizontal wires on the other. The router processes the channel in a same way as 'left edge' algorithm, that is, in a top-to-bottom, row-by-row manner. To improve solutions, it assigns a weight to each net and calculates an optimum net assignment for each row. The assignment can be obtained by a longest path algorithm. The algorithm was implemented for examples in previously published papers. Experimental results show that the new algorithm produces optimum solutions in most cases.

Original languageEnglish
Pages (from-to)64-72
Number of pages9
JournalNEC Research and Development
Issue number75
Publication statusPublished - 1984 Oct
Externally publishedYes

Fingerprint

Routers
Wire
Routing algorithms

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this

IMPROVED LEFT EDGE CHANNEL ROUTER. / Yoshimura, Takeshi.

In: NEC Research and Development, No. 75, 10.1984, p. 64-72.

Research output: Contribution to journalArticle

Yoshimura, T 1984, 'IMPROVED LEFT EDGE CHANNEL ROUTER.', NEC Research and Development, no. 75, pp. 64-72.
Yoshimura, Takeshi. / IMPROVED LEFT EDGE CHANNEL ROUTER. In: NEC Research and Development. 1984 ; No. 75. pp. 64-72.
@article{06594dbbe0254ec7ae959fc9ee5e19ab,
title = "IMPROVED LEFT EDGE CHANNEL ROUTER.",
abstract = "A new channel routing algorithm is presented which is not only simple and fast, but also highly effective. It assumes that pins and wires lie on a common grid in a two layer channel, and that vertical wires are on one layer, horizontal wires on the other. The router processes the channel in a same way as 'left edge' algorithm, that is, in a top-to-bottom, row-by-row manner. To improve solutions, it assigns a weight to each net and calculates an optimum net assignment for each row. The assignment can be obtained by a longest path algorithm. The algorithm was implemented for examples in previously published papers. Experimental results show that the new algorithm produces optimum solutions in most cases.",
author = "Takeshi Yoshimura",
year = "1984",
month = "10",
language = "English",
pages = "64--72",
journal = "NEC Research and Development",
issn = "0048-0436",
publisher = "NEC Media Products Ltd.",
number = "75",

}

TY - JOUR

T1 - IMPROVED LEFT EDGE CHANNEL ROUTER.

AU - Yoshimura, Takeshi

PY - 1984/10

Y1 - 1984/10

N2 - A new channel routing algorithm is presented which is not only simple and fast, but also highly effective. It assumes that pins and wires lie on a common grid in a two layer channel, and that vertical wires are on one layer, horizontal wires on the other. The router processes the channel in a same way as 'left edge' algorithm, that is, in a top-to-bottom, row-by-row manner. To improve solutions, it assigns a weight to each net and calculates an optimum net assignment for each row. The assignment can be obtained by a longest path algorithm. The algorithm was implemented for examples in previously published papers. Experimental results show that the new algorithm produces optimum solutions in most cases.

AB - A new channel routing algorithm is presented which is not only simple and fast, but also highly effective. It assumes that pins and wires lie on a common grid in a two layer channel, and that vertical wires are on one layer, horizontal wires on the other. The router processes the channel in a same way as 'left edge' algorithm, that is, in a top-to-bottom, row-by-row manner. To improve solutions, it assigns a weight to each net and calculates an optimum net assignment for each row. The assignment can be obtained by a longest path algorithm. The algorithm was implemented for examples in previously published papers. Experimental results show that the new algorithm produces optimum solutions in most cases.

UR - http://www.scopus.com/inward/record.url?scp=0021505679&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0021505679&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0021505679

SP - 64

EP - 72

JO - NEC Research and Development

JF - NEC Research and Development

SN - 0048-0436

IS - 75

ER -