This paper describes a novel Field Programmable Gate Array (FPGA) logic synthesis technique which determines if a logic function can be implemented in a given programmable circuit and describes how this problem can be formalized and solved using Quantified Boolean Satisfiability. This technique is general enough to be applied to any type of logic function and programmable circuit; thus, it has many applications to FPGAs. The applications demonstrated in this paper include FPGA technology mapping and resynthesis where their results show significant FPGA performance improvements.
Topics from this Paper
- Field Programmable Gate Array
- Programmable Circuit
- Logic Synthesis Technique
- Logic Function
- Programmable Array Logic
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you haveSchedule a call
- International Conference on Field Programmable Logic and Applications, 2005.
- Oct 10, 2005
- IEE Proceedings - Computers and Digital Techniques
- Jan 1, 2006
- 2012 IEEE 26th International Parallel and Distributed Processing Symposium Workshops & PhD Forum
- May 21, 2012
- IOSR Journal of Engineering
- Apr 1, 2014
- IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Jan 1, 1990
- 17th International Conference on VLSI Design. Proceedings.
- Jan 5, 2004