【摘要】 逻辑函数求补算法存在的主要问题是时间开销大及需要的存储空间过大。该文在对递归裂变求补算法和基于最小项求补算法进行分析研究的基础上,提出了积项输入、邻项合并、积项输出的无冗余覆盖的逻辑函数求补算法。该求补算法的时间、空间的需求将大大缩小。更多还原

【Abstract】 In arithmetic of complement set for logic functions,the excessively long processing times and excessively large memory space requirement are major problems.This paper analyzes arithmetic of complement set on recursion fis-sion and arithmetic of complement set on minimum,at same time ,it presents a new improved method of complement set for logic functions,this method includes input of products and combination of neighbor products and output of products.It greatly reduces time and space requirement.更多还原