By Topic

Solution and Optimization of FPGA Routing Algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Yulan Tang ; Sch. of Inf. Technol., Southern Yangtze Univ., Wuxi, China ; Hao Gao ; Zongguang Yu

Optimized solvers for the Boolean satisfiability problem have many applications in areas such as FPGA routing, planning, and so forth. In the context of FPGA routing where routing resources are fixed, Boolean formulation methods can prove the unroutability of a given circuit, which is a clear advantage over classical net-at-a-time approaches. This paper introduces a new and efficient hybrid routing algorithm for FPGAs. Novel features of this approach include: (1) employing the Pseudo-Boolean Satisfiability to offset the disadvantage of sub-SAT formulation; (2) integrating our approach with geometric routing algorithm. Preliminary experiments results show that this approach can greatly reduce the numbers of variables and clauses, and the running time is dramatic reduced which compared with the sub-SAT.

Published in:

Future Networks, 2009 International Conference on

Date of Conference:

7-9 March 2009