IEEE - Institute of Electrical and Electronics Engineers, Inc. - Comparison of Boolean Satisfiability Encodings on FPGA Detailed Routing Problems

Design, Automation & Test in Europe. DATE'08

Author(s): M.N. Velev ; Ping Gao
Publisher: IEEE - Institute of Electrical and Electronics Engineers, Inc.
Publication Date: 1 March 2008
Conference Location: Munich, Germany
Conference Date: 10 March 2008
Page(s): 1,268 - 1,273
ISBN (CD): 978-3-9810801-4-8
ISBN (Paper): 978-3-9810801-3-1
ISSN (Electronic): 1558-1101
ISSN (Paper): 1530-1591
DOI: 10.1109/DATE.2008.4484853
Regular:

We compare 12 new encodings for representing of FPGA detailed routing problems as equivalent Boolean satisfiability (SAT) problems against the only 2 previously used encodings. We also consider... View More

Advertisement