摘要
在大规模逻辑电路的分析与设计中,直接由大规模真值表得到最简逻辑函数表达式的过程往往比较复杂。针对此问题,提出了一种基于变粒度的大规模真值表快速知识约简算法。随着真值表的输入逻辑变量的粒度变化,通过引入标记矩阵和启发式算子,对大规模真值表进行知识约简,从而得到最简逻辑函数表达式。最后,通过实例分析并详述算法过程,且通过数据集进行对比实验,验证了该算法的快速性与有效性。
In the analysis and design of large-scale logic circuits,the process of obtaining the simplest logic function expression from the large-scale truth table is often complicated.Aiming at this problem,a rapid knowledge reduction algorithm based on variable granularity for large-scale truth table was proposed in this paper.With the change of the granularity of the input logical variables,the simplest logical function expression is quickly acquired from the large-scale truth table by introducing the marker matrix and the heuristic operator.Then,the algorithm is described in detail through an example,and its correctness is proved mathematically.At last,the comparative experiments of data sets are carried out to further prove the rapidness and effectiveness of the proposed algorithm.
作者
宋波
闫继雄
陈泽华
SONG Bo;YAN Ji-xiong;CHEN Ze-hua(College of Information Engineering,Taiyuan University of Technology,Taiyuan 030024,Chin)
出处
《计算机科学》
CSCD
北大核心
2018年第7期167-171,共5页
Computer Science
基金
国家自然科学基金(61402319
61403273)
山西省自然科学基金项目(2014021022-4)资助
关键词
大规模真值表
逻辑函数
变粒度
知识约简
Large-scale truth table
Logic function
Variable granularity
Knowledge reduction