DocumentCode
2973934
Title
Fast Boolean matching based on NPN classification
Author
Zheng Huang ; Lingli Wang ; Nasikovskiy, Yakov ; Mishchenko, Alexander
Author_Institution
State Key Lab. of ASIC & Syst. Fudan Univ., Shanghai, China
fYear
2013
fDate
9-11 Dec. 2013
Firstpage
310
Lastpage
313
Abstract
This paper proposes a fast algorithm for Boolean matching of completely specified Boolean functions. The algorithm is based on the NPN classification and can be applied on-the-fly to millions of small practical functions appearing in industrial designs, leading to runtime and memory reduction in logic synthesis and technology mapping. The algorithm is conceptually simpler, faster, and more scalable than previous work.
Keywords
Boolean functions; logic design; Boolean matching; NPN classification; logic synthesis; memory reduction; runtime reduction; technology mapping; Algorithm design and analysis; Boolean functions; Data structures; Heuristic algorithms; Libraries; Partitioning algorithms; Runtime;
fLanguage
English
Publisher
ieee
Conference_Titel
Field-Programmable Technology (FPT), 2013 International Conference on
Conference_Location
Kyoto
Print_ISBN
978-1-4799-2199-7
Type
conf
DOI
10.1109/FPT.2013.6718374
Filename
6718374
Link To Document