loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Ninth Great Lakes Symposium on VLSI
Routability Prediction for Hierarchical FPGAs
Ann Arbor, Michigan
March 04-March 06
ISBN: 0-7695-0104-4
Wei Li, Nortel Technologies
D.K. Banerji, University of Guelph
This paper investigates the problem of routability prediction in a FPGA that employs a hierarchical routing architecture. Such a FPGcl is called a hierarchical FPGA(HFPGA). A novel model is proposed to analyze various HFPGA configurations. A software tool has been developed to predict the routability of circuits on specific HFPGx4 architectures. Primary contribution of this work is that routability prediction can be done immediately after the technology-mapping step, rather than after placement. The effect of connection block and switch block flexibility on routability is also studied. The results show that compared to a symmetrical FPGA architecture, we can achieve the same degree of routability on a HFPG-4, with much fewer routing switches
Citation:
Wei Li, D.K. Banerji, "Routability Prediction for Hierarchical FPGAs," glsvlsi, pp.256, Ninth Great Lakes Symposium on VLSI, 1999
Usage of this product signifies your acceptance of the Terms of Use.