中北大学学报（自然科学版）2018，Vol.39Issue(1)：1-7,53,8.DOI:10.3969/j.issn.1673-3193.2018.01.001
不完全规定函数的启发式ESOP最小化算法
Heuristic ESOP Minimization Algorithm for Incompletely Specified Functions
摘要
Abstract
For incompletely specified functions,reasonable don't care (DC)assignment can help reduce the complexity of their exclusive-or sum of products (ESOP)forms.A heuristic ESOP minimization al-gorithm which incorporates DC assignment into the process of ESOP reduction was proposed for incom-pletely specified functions.By using cubes set to represent functions,the proposed algorithm first car-ries out DC assignment in Reed-Muller domain according to the adj acent relations between cubes with the help of look-ahead strategy,then performs ESOP reduction by using Exorlink operations,and ap-plies back trace strategy to those DC assignments that can not reduce the complexity of ESOP.A set of incompletely specified functions from MCNC was used to validate the proposed algorithm.Results show that the proposed algorithm can reduce the number of cubes and the number of literals of ESOP,and can be applied to incompletely specified functions with many inputs.关键词
不完全规定函数/无关项赋值/ESOP最小化/启发式方法Key words
incompletely specified functions/don't care assignment/ESOP minimization/heuristic method分类
信息技术与安全科学引用本文复制引用
卜登立..不完全规定函数的启发式ESOP最小化算法[J].中北大学学报（自然科学版）,2018,39(1):1-7,53,8.基金项目
国家自然科学基金资助项目(61640412) （61640412）
流域生态与地理环境监测国家测绘地理信息局重点实验室资助课题(WE2016012) （WE2016012）
江西省教育厅科技计划资助项目(GJJ160746) （GJJ160746）
