A detailed router for field-programmable gate arrays
- 4 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
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
This publication has 7 references indexed in Scilit:
- The effect of switch box flexibility on routability of field programmable gate arraysPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Segmented channel routingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Parallel global routing for standard cellsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1990
- The effect of logic block complexity on area of programmable gate arraysPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1989
- A 5000-gate CMOS EPLD with multiple logic and interconnect arraysPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1989
- Wire routing by optimizing channel assignment within large aperturesPublished by Association for Computing Machinery (ACM) ,1971
- An Algorithm for Path Connections and Its ApplicationsIEEE Transactions on Electronic Computers, 1961