一种新的计算最大允许函数集的方法

A New Approach to Calculating the Maximum Sets of Permissible Functions

变换化简法是一种通过计算逻辑网络中门或连线处的最大允许函数集来消除网络中冗余门或连线的多级逻辑优化算法。文中提出了一种新的计算门处最大允许函数集的方法。该方法通过计算逻辑网络中门处的可观测性无关项较为容易得到最大允许函数集。实验结果表明，该方法在计算时间上明显优于原来的计算方法。

A new approach to calculating the maximum sets of permissible functions is presented in the paper. Based on this new approach,maximum sets of permissible functions can be easily derived by calculating the observability don't care sets for the outputs of the gates in the network. Experiments show that this new approach requires less CPU time than the previous method.