NEW 2-OR-3 LAYER CHANNEL ROUTER FOR VLSI LAYOUT.

Jer Min Jou, Jau Yien Lee, Bin Da Liu, Jhing Fa Wang, Gern Wang

Research output: Contribution to journalConference article

2 Citations (Scopus)

Abstract

A two- or three-layer greedy channel router, which is based on the extension of the dynamic adaptive generalized router (DAPRT) and can route a channel in two or three layers, is presented. The time complexity of the router is O(n multiplied by W), where n is the number of columns in a channel, and W is the width of a channel. The algorithm has been coded in Pascal and implemented on a VAX-11/780 computer. Results from several benchmark problems are evaluated. The router consistently outperforms several known routers in quality of wiring in three-layer routing. For example, it finds a ten-track solution for the three-layer Deutsch's difficult example, whereas all other known routers required 11 or more tracks; for the two-layer case, it also routes the problem with only 19 tracks.

Original languageEnglish
Pages (from-to)47-50
Number of pages4
JournalProceedings - IEEE International Symposium on Circuits and Systems
Publication statusPublished - 1987 Jan 1

Fingerprint

Routers
Pascal (programming language)
Electric wiring

All Science Journal Classification (ASJC) codes

  • Electrical and Electronic Engineering

Cite this

Jou, Jer Min ; Lee, Jau Yien ; Liu, Bin Da ; Wang, Jhing Fa ; Wang, Gern. / NEW 2-OR-3 LAYER CHANNEL ROUTER FOR VLSI LAYOUT. In: Proceedings - IEEE International Symposium on Circuits and Systems. 1987 ; pp. 47-50.
@article{b18bdeee22f34926ac0e5fde33cb619d,
title = "NEW 2-OR-3 LAYER CHANNEL ROUTER FOR VLSI LAYOUT.",
abstract = "A two- or three-layer greedy channel router, which is based on the extension of the dynamic adaptive generalized router (DAPRT) and can route a channel in two or three layers, is presented. The time complexity of the router is O(n multiplied by W), where n is the number of columns in a channel, and W is the width of a channel. The algorithm has been coded in Pascal and implemented on a VAX-11/780 computer. Results from several benchmark problems are evaluated. The router consistently outperforms several known routers in quality of wiring in three-layer routing. For example, it finds a ten-track solution for the three-layer Deutsch's difficult example, whereas all other known routers required 11 or more tracks; for the two-layer case, it also routes the problem with only 19 tracks.",
author = "Jou, {Jer Min} and Lee, {Jau Yien} and Liu, {Bin Da} and Wang, {Jhing Fa} and Gern Wang",
year = "1987",
month = "1",
day = "1",
language = "English",
pages = "47--50",
journal = "Proceedings - IEEE International Symposium on Circuits and Systems",
issn = "0271-4310",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

NEW 2-OR-3 LAYER CHANNEL ROUTER FOR VLSI LAYOUT. / Jou, Jer Min; Lee, Jau Yien; Liu, Bin Da; Wang, Jhing Fa; Wang, Gern.

In: Proceedings - IEEE International Symposium on Circuits and Systems, 01.01.1987, p. 47-50.

Research output: Contribution to journalConference article

TY - JOUR

T1 - NEW 2-OR-3 LAYER CHANNEL ROUTER FOR VLSI LAYOUT.

AU - Jou, Jer Min

AU - Lee, Jau Yien

AU - Liu, Bin Da

AU - Wang, Jhing Fa

AU - Wang, Gern

PY - 1987/1/1

Y1 - 1987/1/1

N2 - A two- or three-layer greedy channel router, which is based on the extension of the dynamic adaptive generalized router (DAPRT) and can route a channel in two or three layers, is presented. The time complexity of the router is O(n multiplied by W), where n is the number of columns in a channel, and W is the width of a channel. The algorithm has been coded in Pascal and implemented on a VAX-11/780 computer. Results from several benchmark problems are evaluated. The router consistently outperforms several known routers in quality of wiring in three-layer routing. For example, it finds a ten-track solution for the three-layer Deutsch's difficult example, whereas all other known routers required 11 or more tracks; for the two-layer case, it also routes the problem with only 19 tracks.

AB - A two- or three-layer greedy channel router, which is based on the extension of the dynamic adaptive generalized router (DAPRT) and can route a channel in two or three layers, is presented. The time complexity of the router is O(n multiplied by W), where n is the number of columns in a channel, and W is the width of a channel. The algorithm has been coded in Pascal and implemented on a VAX-11/780 computer. Results from several benchmark problems are evaluated. The router consistently outperforms several known routers in quality of wiring in three-layer routing. For example, it finds a ten-track solution for the three-layer Deutsch's difficult example, whereas all other known routers required 11 or more tracks; for the two-layer case, it also routes the problem with only 19 tracks.

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

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

M3 - Conference article

AN - SCOPUS:0023210532

SP - 47

EP - 50

JO - Proceedings - IEEE International Symposium on Circuits and Systems

JF - Proceedings - IEEE International Symposium on Circuits and Systems

SN - 0271-4310

ER -