Routability-Driven Packing: Metrics and Algorithms for Cluster-Based FPGAS
- Topics:
- Electrical and Electronic
- Tags:
- Algorithm,
- CAD,
- Clustering,
- Engineering,
- FPGA,
- Metrics,
- Software,
- World Scientific Publishing
- Source:
- World Scientific Publishing
FREE Registration is required
Overview: Most of the FPGA's area and delay are due to routing. Considering routability at earlier steps of the CAD flow would both yield better quality and faster design process. This paper discusses the metrics that affect routability in packing logic into clusters. It presents a routability-driven clustering method for cluster-based FPGAs. The method packs LUTs into logic clusters while incorporating routability metrics into a cost function. Based on the routability model, the routability in timing-driven packing algorithm is analyzed.
(Is this item miscategorized? Does it need more tags? Let us know.)
Format: PDF | Size: 321KB | Date: Jan 2003 | Pages: 24






