A Boolean satisfiability-based incremental rerouting approach with application to FPGAs
- 13 November 2002
- conference paper
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- An implicit connection graph maze routing algorithm for ECO routingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Satisfiability-based layout revisitedPublished by Association for Computing Machinery (ACM) ,1999
- Methodologies for tolerating cell and interconnect faults in FPGAsIEEE Transactions on Computers, 1998
- On two-step routing for FPGASPublished by Association for Computing Machinery (ACM) ,1997
- VPR: a new packing, placement and routing tool for FPGA researchLecture Notes in Computer Science, 1997
- Logic synthesis for engineering changePublished by Association for Computing Machinery (ACM) ,1995
- A detailed router for field-programmable gate arraysIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1992
- Field-Programmable Gate ArraysPublished by Springer Science and Business Media LLC ,1992
- Graph-Based Algorithms for Boolean Function ManipulationIEEE Transactions on Computers, 1986
- An Algorithm for Path Connections and Its ApplicationsIEEE Transactions on Electronic Computers, 1961