Two algorithms for three-layer channel routing

✍ Scribed by R. Srinivasan; L.M. Patnaik

• Publisher: Elsevier Science
• Year: 1984
• Tongue: English
• Weight: 737 KB
• Volume: 16
• Category: Article
• ISSN: 0010-4485
• DOI: 10.1016/0010-4485(84)90084-8

✦ Synopsis

A channel router is an important design aid in the design automation of VLSI circuit layout. Many algorithms have been developed based on various wiring models with routing done on two layers. With the recent advances in VLSI process technology, it is possible to have three independent layers for interconnection. In this paper two algorithms are presented for three-layer channel routing. The first assumes a very simple wiring mode/. This enables the routing problem to be solved optimally in a time of O(n log n). The second algorithm is for a different wiring model and has an upper bound of O(n 2) for its execution time. It uses fewer horizontal tracks than the first algorithm. For the second model the channel width is not bounded by the channel density.

VLSI circuit desig% channel routing, algorithms