摘要
本文提出了用输入矢量图对三值T函数展开式进行简化与综合的方法。它适用于任意T函数的展开式,并能获得最佳或接近最佳的简化结果。
In this paper an input vector map is presented for the minimization and synthesis of ternary function based on T expansion. The map is applicable to arbitrary ternary function and can achieve an optimal or near optimal minimization for ternary tree (T-Gate).
出处
《电子学报》
EI
CAS
CSCD
北大核心
1991年第6期111-115,共5页
Acta Electronica Sinica