[PDF][PDF] On routability prediction for field-programmable gate arrays
PK Chan, MDF Schlag, JY Zien - Proceedings of the 30th international …, 1993 - dl.acm.org
PK Chan, MDF Schlag, JY Zien
Proceedings of the 30th international Design Automation Conference, 1993•dl.acm.orgEfficient utilization of Field Programmable Gate Arrays(FPGAs) depends on the ability to
determine whether designs will exceed the logic or routing capacities of the devices. Here,
we focus on the problem of assessing the routability of designs for FPGAs before place-and-
rpute. Specifically, we identify the relevant wmeabilit yt heorles, modify and adapt the
theories for FPGAs, and conduct experiments to validate the theories.
determine whether designs will exceed the logic or routing capacities of the devices. Here,
we focus on the problem of assessing the routability of designs for FPGAs before place-and-
rpute. Specifically, we identify the relevant wmeabilit yt heorles, modify and adapt the
theories for FPGAs, and conduct experiments to validate the theories.
Abstract
Efficient utilization of Field Programmable Gate Arrays(FPGAs) depends on the ability to determine whether designs will exceed the logic or routing capacities of the devices. Here, we focus on the problem of assessing the routability of designs for FPGAs before place-and-rpute. Specifically, we identify the relevant wmeabilit y t heorles, modify and adapt the theories for FPGAs, and conduct experiments to validate the theories.
ACM Digital Library