EFFICIENT ALGORITHMS FOR CHANNEL ROUTING.

Takeshi Yoshimura*, Ernest S. Kuh

*この研究の対応する著者

研究成果: Article査読

297 被引用数 (Scopus)

抄録

In the layout design of LSI chips, channel routing is one of the key problems. The problem is to route a specified net list between two rows of terminals across a two-layer channel. Nets are routed with horizontal segments on one layer and vertical segments on the other. Connections between two layers are made through via holes. Two new algorithms are proposed. These algorithms merge nets instead of assigning horizontal tracks to individual nets. The algorithms were coded in Fortran and implemented on a VAX 11/780 computer. Experimental results are quite encouraging. Both programs generated optimal solutions in 6 out of 8 cases, using examples in previously published papers. The computation times of the algorithms for a typical channel (300 terminals, 70 nets) are 1. 0 and 2. 1 s, respectively.

本文言語English
ページ(範囲)25-35
ページ数11
ジャーナルIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
CAD-1
1
出版ステータスPublished - 1982 1
外部発表はい

ASJC Scopus subject areas

  • 計算理論と計算数学
  • コンピュータ サイエンスの応用
  • ハードウェアとアーキテクチャ
  • 電子工学および電気工学

フィンガープリント

「EFFICIENT ALGORITHMS FOR CHANNEL ROUTING.」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル