三值逻辑函数表格法最小化的一种新方法

New method of tabular minimization for ternary logical function

根据格代数公式,对三值逻辑函数表格法最小化提出一种新方法。在搜索蕴涵项、质蕴涵项的过程中,采用找出满足下述 条件最小项的策略:一是相邻最小项的数量为3的m次或者m-1次幂,同时保证m数值尽量大(m=1,2,…)。二是最小项的逻辑值为“1”或“2。为此,利用避开最邻近的最小项方法(该最小项逻辑值小于被选择最小项的逻辑值),从而减少了冗余项的数量。这种 方法尤其适合于含有大量无关项的多变量三值逻辑函数最小化。

According to the lattice algebra formulas,this paper puts forward a new method of minimizing the ternary logical function in tables. When searching for both the implicative terms and prime implicative terms,I use the tactics of finding out the minterms. When m is maximized,the quantity of its consecutive minterms is m or m-1 power of 3 (m=1,2,…).The logical quantity of the minterms is‘1’or‘2’.For this reason,I take advantage of the method of avoiding the nearest minterms (making the logical values of the minterms less than the logical values of chosen minterms), to reduce the quantity of the redundancy terms. This method especially suits for the minimization of the multi-variable ternary logical function which includes a good many of don抰 -care terms.