摘要
在EDA设计工具的HDL综合系统中,高级综合、RTL级综合和逻辑级综合等都常常需要对逻辑函数进行永真式的判定。本文给出一种高效的永真式判定算法,该算法利用余因子、Shannon展开式和单边函数,对逻辑函数的多维体列阵进行快速有效的递归判定。该算法已经在自行研制的VHDL综合系统HLS/BIT中实际应用。
In HDL synthesis systems of EDA design tools, it often needs to be judged in high-level synthesis, RTL-level synthesis and logic-level synthesis whether a logical function is a tautology. This paper gives a fast algorithm based on the concepts of cofactor, Shannon expansion and unate function to recursively and quickly judge if a given cube array of logical function is a tautology. This algorithm has been used in the VHDL synthesis system HLS/BIT.
出处
《安徽大学学报(自然科学版)》
CAS
1998年第3期42-47,共6页
Journal of Anhui University(Natural Science Edition)
基金
国家国防科技预研资助
国家"九五"科技攻关
国家教委博士点基金
关键词
永真式
逻辑函数
VHDL综合系统
EDA
tautology, algorithm, cube array, cofactor, Shannon expansion, unate function.