Title :
A detailed router for field-programmable gate arrays
Author :
Brown, S. ; Rose, J. ; Vranesic, Z.
Author_Institution :
Dept. of Electr. Eng., Toronto Univ., Ont., Canada
Abstract :
The course graph expansion (CGE) detailed routing algorithm is presented for FPGAs (field-programmable gate arrays). The algorithm has the ability to resolve routing conflicts by considering the side-effects of one connection on another, and can be used over a wide range of FPGA interconnection architectures. CGE has been used to obtain excellent routing results for several industrial circuits with various FPGA routing architectures. The results show that CGE is able to route relatively large FPGAs in the absolute minimum number of tracks as determined by global routing, and that CGE has a linear run-time over circuit size.<>
Keywords :
circuit layout CAD; logic CAD; logic arrays; course graph expansion; detailed router; field-programmable gate arrays; Application specific integrated circuits; Field programmable gate arrays; Integrated circuit interconnections; Integrated circuit manufacture; Logic arrays; Programmable logic arrays; Routing; Runtime; Switches; Wiring;
Conference_Titel :
Computer-Aided Design, 1990. ICCAD-90. Digest of Technical Papers., 1990 IEEE International Conference on
Conference_Location :
Santa Clara, CA, USA
Print_ISBN :
0-8186-2055-2
DOI :
10.1109/ICCAD.1990.129931
