DocumentCode
391930
Title
Detailed routing in a hierachical CPLD
Author
Kennings, A. ; Behjat, L. ; Coppola, A.
Author_Institution
Waterloo Univ., Ont., Canada
Volume
1
fYear
2002
fDate
4-7 Aug. 2002
Abstract
We describe the detailed routing of a commercial complex programmable logic device (CPLD). The hierarchical, course-grained architecture of the CPLD lends itself to a novel hybrid router that combines a negotiated maze-router with a flow-based router. Numerical results illustrate that our router is significantly faster than a flat maze-router. It also has a higher completion rate compared to a commercial router while producing routings of comparable quality.
Keywords
hierarchical systems; integrated circuit design; integrated circuit interconnections; logic design; programmable logic devices; CPLD detailed routing; PIMS; PLD; complex programmable logic device; course-grained architecture; flow-based router; hierachical CPLD; hybrid router; negotiated maze-router; programmable interconnect matrices; router completion rate; routing quality; routing speed; Costs; Flow graphs; Logic devices; Logic functions; Macrocell networks; Predictive models; Routing; Switches; Timing; Wire;
fLanguage
English
Publisher
ieee
Conference_Titel
Circuits and Systems, 2002. MWSCAS-2002. The 2002 45th Midwest Symposium on
Print_ISBN
0-7803-7523-8
Type
conf
DOI
10.1109/MWSCAS.2002.1187294
Filename
1187294
Link To Document