An exact algorithm to minimize mixed-radix exclusive sums of products for incompletely specified Boolean functions

An exact algorithm to minimize mixed-radix exclusive sums of products for incompletely specified Boolean functions
复制标题

一种最小化不完全指定布尔函数的混合基数独占乘积和的精确算法

DOI：
10.1109/iscas.1990.112455
复制
发表时间：
1990
期刊：
IEEE International Symposium on Circuits and Systems
影响因子：
--
通讯作者：
M. Chrzanowska
M. Chrzanowska
中科院分区：
--
文献类型：
--
作者：
M. Perkowski;M. Chrzanowska

文献摘要

被引文献

相似文献

提出了一种任意大小不完全指定布尔函数混合极性乘积互斥和（ESOP）表达式的精确综合算法。对于四个以上的输入变量，这个问题还没有解决。一个决策函数H构造的布尔函数f，描述所有可能的ESOP解决方案f。函数H在ESOP极小化问题中的作用类似于经典逻辑中的Petrick函数在乘积表达式的包含和极小化问题中的作用。每个满足函数H的文字的乘积对应于f的一个ESOP解。给出了生成和求解H函数的算法。&lt;<ETX>&gt;
An exact algorithm for the synthesis of mixed polarity exclusive sum of product (ESOP) expressions for arbitrary size incompletely specified Boolean functions is presented. For more than four input variables, this problem has not been solved yet. A decision function H is constructed for a Boolean function f that describes all possible ESOP solutions to f. The function H plays for the ESOP minimization problem a role analogous to that of the Petrick function for the minimization of the inclusive sum of product expression problem of classical logic. Each product of literals that satisfies the function H corresponds to one ESOP solution of f. The algorithms to create and solve function H are presented.<<ETX>>