摘要
在逻辑综合的领域内 ,经常使用求给定积项集合补集的过程。本文提出一个单边逻辑函数积项集合的求补算法 ,求补操作是通过选取函数矩阵的列覆盖进行的。与传统求补算法相比 。
In the area of logic synthesis ,a procedure of derivation of complements for a given product set is frequently used. We present a method for that by the identification of column covers of a binary matrix. The method greatly reduced the time and space requirements compared to traditional procedures. [
出处
《微机发展》
2001年第2期11-14,共4页
Microcomputer Development
