Minimum skew and minimum path length routing in VLSI layout design

Masato Edahiro*

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

研究成果: Chapter

23 被引用数 (Scopus)

抄録

This paper presents a routing algorithm to accomplish the minimum skew as well as the minimum path length. For a net, this algorithm guarantees an equidistant routing for all the paths from the fan-out terminal to fan-in terminals of the net. In addition, the minimum path length routing is achieved for these paths among all the minimum skew routings. Since this algorithm allows each terminal to have a weight as a load, the skew for a net is still minimized even if terminals in the net have different loads. Moreover, a bottom-up routing method is proposed for circuits with a hierarchy. In this method, nets are routed first at the bottom of the logic hierarchy, and then routings are performed in higher levels of the hierarchy taking routing lengths in the lower levels into account. Owing to the bottom-up routing method, the proposed algorithm also guarantees skew minimization for circuits with a hierarchy.

本文言語English
ホスト出版物のタイトルNEC Research and Development
出版社Publ by Nippon Electric Co
ページ569-575
ページ数7
32
4
出版ステータスPublished - 1991 10月
外部発表はい

ASJC Scopus subject areas

  • 電子工学および電気工学

フィンガープリント

「Minimum skew and minimum path length routing in VLSI layout design」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル