Fast Filter-Based Boolean Matchers
Fast Filter-Based Boolean Matchers
复制标题
DOI：
10.1109/les.2013.2280582
复制
发表时间：
2013-09
影响因子：
1.6
通讯作者：
Chaofan Yu;Lingli Wang;Chun Zhang;Yu Hu;Lei He
中科院分区：
文献类型：
--
作者：
Chaofan Yu;Lingli Wang;Chun Zhang;Yu Hu;Lei He
Boolean matching is one of the fundamental and time-consuming procedures in field-programmable gate array (FPGA) synthesis. The SAT-based Boolean matchers (BMs) are not scalable while other Boolean matchers based on complicated Boolean logic operation algorithms are not flexible for complex PLBs. Recently, a scalable Boolean matcher (F-BM) based on the Bloom filter has been proposed for both scalability and flexibility. However, it requires large amount of memory space which can be a bottleneck for traditional personal computers. To tackle that problem, this letter proposes a novel Boolean matcher with much less memory requirement. Compared with F-BM, the proposed Boolean matcher has achieved an average of 5% better result with 2000x smaller storage and only 1.6x more runtime when applying to the same application. The significant reduction of storage requirements makes the proposed Boolean matcher able to handle more complicated PLB structures with larger input sizes.
