【摘要】 用精选法求布尔函数的最小化解时,传统的作法是先求出质覆盖Z,然后从Z中挑选必要质蕴涵项。本文提出的E算法在勿需求出质覆盖的情况下,就可以判断出多输出二值布尔函数的一个质蕴涵项是否是必要质蕴涵项,从而节省计算机的存储空间和运算时间。更多还原

【Abstract】 In minimizing a boolean function using the extraction method, the tradi tional steps are: getting the prime cover Z first; and then extracting the essential prime implicant from Z.The algorithm E proposed in this paper is capable of deter mining whether a prime implicant is an essential prime implicant or not without the prime cover Z. The requirements of memory space and CPU time are reduced greatly.更多还原