布尔函数的代数因子分解

The Algebraic Decomposition and Factoring of Boolean Functions

本文改进了布尔函数的代数因子分解算法ＡＬＧ＿ＤＩＶ和ＱＦ，采用“分治”方式降低了分解过程的计算时间复杂性，提高了多级逻辑函数分解的效率，能获得近似优化的多级逻辑分解结果．

This paper is introduced improvement the algorithm ALG _DIV and QF that decompose and factor the Boolean functions. In this paper, the “divide and conquer” strategy is used to reduce the computing complexity and to improve the computing efficiency of the process to decompose and factor the Boolean functions. The improved algorithm can get a near optimal multilevel logic forms of the Boolean functions.