A graph algorithm to route noncrossing VDD and GND trees on one layer is developed for VLSI designs. The algorithm finds trees with as small an area as tractably possible under metal-migration and voltage-drop constraints. Experimental results show that the power wire area is considerably smaller than that of a previously developed method for single-layer routing.
|ホスト出版物のタイトル||Unknown Host Publication Title|
|出版ステータス||Published - 1987 12 1|
ASJC Scopus subject areas