DocumentCode :
3147745
Title :
A New Channel Routing Problem
Author :
Leong, H.W. ; Liu, C.L.
Author_Institution :
Department of Computer Science, University of Illinois at Urbana-Champaign, Urbana, IL
fYear :
1983
fDate :
27-29 June 1983
Firstpage :
584
Lastpage :
590
Abstract :
In this paper, we present a new model for channel routing. This model generalizes of the model previously studied in the literature. Informally, our model allow the possibility of connecting, for any given net, only some but not all of the pins that belongs to that net. An algorithm for this model was designed and implemented. Experimental results showed that our algorithm is quite effective.
Keywords :
Algorithm design and analysis; Circuits; Computer science; Joining processes; Pins; Routing; Wires; Wiring;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Design Automation, 1983. 20th Conference on
ISSN :
0738-100X
Print_ISBN :
0-8186-0026-8
Type :
conf
DOI :
10.1109/DAC.1983.1585713
Filename :
1585713
Link To Document :
بازگشت