Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
A Boolean-based router expresses the routing constraints as a Bool-ean function which is satisfiable if and only if the layout is routable.
 

Summary: ABSTRACT
A Boolean-based router expresses the routing constraints as a Bool-
ean function which is satisfiable if and only if the layout is routable.
Compared to traditional routers, Boolean-based routers offer two
unique features: (1) simultaneous embedding of all nets regardless
of net ordering, and (2) ability to demonstrate routing infeasibility
by proving the unsatisfiability of the generated routing constraint
Boolean function. In this paper, we introduce a new Boolean-based
FPGA detailed routing formulation that yields an easy-to-evaluate
and more scalable routability Boolean function than the previous
methods. The routability constraints are expressed in terms of a set
of "route" variables each of which designating a specific detailed
route for a given net. Experimental results clearly show the superi-
ority of this formulation over an earlier formulation that expressed
the constraints in terms of "track" variables.
1. INTRODUCTION
Largely due to the significant improvement in their density and perfor-
mance over the last few years, Field-Programmable Gate Arrays
(FPGAs) have become an increasingly attractive design medium. Yet
the majority of FPGA synthesis algorithms are primarily adapted from

  

Source: Aloul, Fadi - Department of Computer Engineering, American University of Sharjah

 

Collections: Engineering