Table of Contents
VLSI Design
Volume 1, Issue 3, Pages 233-242

An Optimum Channel Routing Algorithm in the Knock-knee Diagonal Model

Dipartimento di Informatica, Università di Pisa, Pisa, Italy

Received 30 July 1990; Revised 11 August 1992

Copyright © 1994 Hindawi Publishing Corporation. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


Channel routing problem is an important, time consuming and difficult problem in VLSI layout design. In this paper, we consider the two-terminal channel routing problem in a new routing model, called knock-knee diagonal model, where the grid consists of right and left tracks displayed at +45° and –45°. An optimum algorithm is presented, which obtains d + 1 as an upper bound to the channel width, where d is the channel density.