2013 3rd IEEE International Advance Computing Conference (IACC) 2013
DOI: 10.1109/iadcc.2013.6514241
|View full text |Cite
|
Sign up to set email alerts
|

Graph colouring based multi pin net detailed routing for FPGA using SAT

Abstract: A SAT based detailed routing technique for island style FPGA architecture is presented in this paper. This technique uses the graph-colouring paradigm to propose a routing technique which routes multiple nets without decomposing them into 2-pin subnets for simplicity. In spite of this fact, the technique proposed proves to be efficient and scalable since it leverages the computing power of fast SAT solvers running in the back end, as shown by the experiments on benchmark circuits.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2015
2015
2019
2019

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 7 publications
(1 citation statement)
references
References 15 publications
0
1
0
Order By: Relevance
“…The historical congestion penalty h(n) is updated after every pathfinder routing iteration (5). The impact of h(n) on the total resource cost is controlled by the factor h f .…”
Section: Routing Schedulementioning
confidence: 99%
“…The historical congestion penalty h(n) is updated after every pathfinder routing iteration (5). The impact of h(n) on the total resource cost is controlled by the factor h f .…”
Section: Routing Schedulementioning
confidence: 99%