摘要： 在现场可编程门阵列的自动化综合流程中，布尔匹配是核心子问题之一。基于布隆过滤器的布尔匹配方法需要消耗大量存储空间并牺牲部分可实现函数的覆盖率。针对该问题，提出一种布尔匹配方法，给出布尔函数的规则表达形式，对布尔函数进行分类，并在布尔匹配的过程中进行动态学习。实验结果表明，通过对函数分类可以使布尔匹配库所需的存储空间降低96%，而动态学习策略可以使电路在逻辑再综合算法应用中额外节省13%的LUT数目。

关键词: 现场可编程门阵列, 布隆过滤器, 布尔匹配, 函数分类, 动态学习, 逻辑再综合

Abstract: In the field of Field Programmable Gate Array(FPGA) automation integrated process, Boolean Matching(BM) is one of the core problems. The Boolean matching method based on Bloom filter needs to consume a large amount of storage space and sacrifices part coverage of realizable function. Aiming at this problem, this paper proposes a Boolean matching method, presents a rule expression form based on Boolean function, which classifies the Boolean function, and carries on dynamic learning in the process of Boolean matching. Experimental results show that, the storage space of Boolean matching can be saved up to 96% by the function classification, and dynamic learning strategy can make the circuit reduce excessively 13% LUT number in application of Logic synthesis algorithm.

Key words: Field Programmable Gate Array(FPGA), Bloom filter, Boolean Matching(BM), function classification, dynamic learning, logic resynthesis

中图分类号: 

• TP311