DocumentCode :
3292725
Title :
SAT for heterogeneous FPGA technology mapping
Author :
Fan Quanrun ; Jianyong, Sun
Author_Institution :
Dept. of Comput. Sci., Chuxiong Normal Univ., Chuxiong, China
fYear :
2011
fDate :
15-17 April 2011
Firstpage :
4449
Lastpage :
4452
Abstract :
Modern FPGAs employ heterogeneous architecture to reduce power dissipation, area overhead, and to improve performance. Besides lookup tables, heterogeneous FPGA also contains ASIC-like sub-circuits and macro-gates. If a programmable logic block with n inputs contains macro-gates, a Boolean function with n variable may not be implemented in it. In this paper, a Boolean satisfiability based technology mapping methods is suggested, which us symmetry to speed up the mapping process.
Keywords :
computability; field programmable gate arrays; logic gates; table lookup; ASIC-like subcircuits; Boolean function; Boolean satisfiability technology mapping methods; heterogeneous FPGA technology mapping; lookup tables; macrogates; power dissipation reduction; programmable logic block; Application specific integrated circuits; Boolean functions; Complexity theory; Computer architecture; Design automation; Field programmable gate arrays; Hardware; Boolean satisfiability; heterogeneous FPGA; technology mapping;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Electric Information and Control Engineering (ICEICE), 2011 International Conference on
Conference_Location :
Wuhan
Print_ISBN :
978-1-4244-8036-4
Type :
conf
DOI :
10.1109/ICEICE.2011.5778288
Filename :
5778288
Link To Document :
بازگشت