An effective computer algorithm for the calculation of disjoint cube representation of Boolean functions

An effective computer algorithm for the calculation of disjoint cube representation of Boolean functions
复制标题

计算布尔函数不相交立方表示的有效计算机算法

DOI：
--
复制
发表时间：
1993
期刊：
Proceedings of 36th Midwest Symposium on Circuits and Systems
影响因子：
--
通讯作者：
Chip
Chip
中科院分区：
--
文献类型：
--
作者：
B. Falkowski;I. Schafer;Chip

文献摘要

被引文献

相似文献

本文给出了一种计算布尔函数最优立方体阵列规格的有效算法。由于不相交立方体的数量远小于最小项的数量，因此内存需求显著降低。给出了MCNC基准函数的程序执行与ESTERO的比较结果。&lt;<ETX>&gt;
An efficient computer algorithm is shown to calculate an optimal cube array specification of Boolean functions. Since the number of disjoint cubes is much smaller than the number of minterms, the memory requirements are significantly reduced. The results of a comparison of the execution of the program with ESPRESSO for the MCNC benchmark functions are given.<<ETX>>