Research and Realization of Complement Set Arithmetic for Multi-Valued Logic Function

摘要：

The optimization of multi-valued logic function is an extension of binary-valued logic function. Realization of multi-valued logic function is based on binary computer. In the complement set of logic synthesis, it is realized that non-completeness enumerate is transformed to completeness enumerate. In order to get the complement set of multi-valued logic function, the procedure is given out as bellow. At first, describes multi-valued variable and multi-valued logic function by binary vector. Secondly,transforms multi-valued cube into the Boolean expression.At last, calls recursion fission arithmetic to get the result.The time complexity of the arithmetic is O(3n), the space complexity is O(2n+1).

关键词： Arithmetic Multi-valued Logic Function Complement Set Recursion fission

作者: Jianlin Qiu Bo Wang

作者单位: School of Computer Science and Technology, Nantong University Nantong, Jiangsu 226019, P.R.China

会议类型: 国际会议

会议名称: 2006 International Symposium on Distributed Computing and Applications to Business,Engineering and Science(2006年国际电子、工程及科学领域的分布式计算应用学术研讨会)

会议地点: 杭州

会议语种:英文

页码: 65-68

在线出版日期: 2006-10-12（万方平台首次上网日期，不代表论文的发表时间）