2 Algorithms For 3-Layer Channel Routing

Srinivasan, R and Patnaik, LM (1984) 2 Algorithms For 3-Layer Channel Routing. In: Computer-Aided Design, 16 (5). pp. 264-271.

PDF 27.pdf - Published Version Restricted to Registered users only Download (755kB) | Request a copy

Abstract

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 model. 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(n2) 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.

Item Type:	Journal Article
Publication:	Computer-Aided Design
Publisher:	Elsevier Science
Additional Information:	Copyright of this article belongs to Elsevier Science.
Keywords:	VLSI circuit design;channel routing;algorithms.
Department/Centre:	Division of Electrical Sciences > Computer Science & Automation
Date Deposited:	14 Aug 2009 06:14
Last Modified:	19 Sep 2010 05:41
URI:	http://eprints.iisc.ac.in/id/eprint/22334

Actions (login required)

View Item