三值逻辑函数在不同极性下的固定极性RM(reed-muller)电路实现形式所对应的电路面积不尽相同,通过对多值列表技术的研究,提出一种三值不同逻辑的极性转换算法。首先根据三值FPRM(fixed-polarity reed-muller)固定极性展开式的特点,建立三值FPRM电路面积估计模型;然后由多值列表技术推导出三值格代数积之和展开式到RM逻辑展开式极性转换算法。在此基础上,结合遗传算法,进行三值FPRM面积最佳极性搜索。通过对8个MCNC基准电路测试表明,所提算法搜索到的最佳极性三值FPRM电路,与0极性时相比,面积平均节省达到47.4%。
According to the different ternary fixed polarity RM(Reed-Muller) logic expression corresponding to the circuit area at different polarities,a ternary polarity conversion algorithm for different logic was proposed through the research of multiple valued tabular technique.First,according to the ternary FPRM(Fixed-Polarity Reed-Muller) fixed polarity expansion characteristics,the ternary FPRM circuit area estimation model value was established.Second,the ternary sum of product expansion of lattice algebra to the RM logical expansion polarity conversion algorithm was derived from multiple valued tabular technique.On the basis,the genetic algorithm was applied to searching the polarity with the minimal area of the ternary FPRM circuit.Final,the results of testing eight circuits from MCNC Benchmark indicate that this algorithm is highly effective for searching the best polarity.The ternary FPRM circuits under the polarity searched by the proposed algorithm have achieved average area-saving by 47.4%,compared with the circuits under polarity 0.