Fast Channel Graph Construction

Abstract

Channel routing is a valuable VLSI routing technique that requires the routing region be divided into rectangular regions or channels. A new algorithm is proposed that constructs the channels and determines the adjacencies between the channels in O(n]cgn mm) time, where n is the number of modules in the circuit and m is the number of channels that are created. In addition to its fast run - t'1me. this algorithm has a parameter /1' 1:5: '~~i:s control of the number of channels created. Note: Abstract extracted from PDF file via OCR