A new method for generating prime implicants is presented in the paper. A minimization algorithm for incompletely specified functions based on the method is also given. The procedure starts form a minterm, base minterm. By searching for its adjacent minterms from lower order to higher order, prime implicants are generated. Because adjacent minterm operation is simple for computers to process, the method is time saving. We have compared the proposed method to that presented by Z. Arevalo ad J. Bredeson [1] over sets of randomly produced inputs. The experiments show that the former is, in average, six times faster than the later. Take the number of product terms and the number of literals in a solution as a measure of quality, The proposed algorithm is better than or equal to Arevalo-Bredeson algorithm.
展开▼
机译：本文提出了一种生成主要血管的新方法。还给出了基于该方法的未完全指定函数的最小化算法。该过程开始形成MinterM，基本Minterm。通过从较低顺序搜索其相邻的minterms到更高阶，产生了主要血迹。由于相邻的MinterM操作对于计算机来处理很简单，因此该方法是节省时间。我们已经将所提出的方法与Z.Anvalo AD J.Bredeson [1]提供的方法进行了比较。超过一组随机生产的输入。实验表明，前者平均六倍速度比后来速度快。采用产品术语数量和解决方案中的文字数量作为质量的量度，所提出的算法优于或等于Arvalo-Bredeson算法。
展开▼
