Integer Pair Representation of Binary Terms and Equations

MWSCAS '98 Proceedings of the 1998 Midwest Symposium on Systems and Circuits(1998)

引用 3|浏览3
暂无评分
摘要
A new format to represent binary terms in a Boolean function, called the Integer Pair Representation (IPR) is proposed. This format uses an ordered pair of integers to compactly represent each cube of a Boolean function written as a sum-of-products in either canonical or non-canonical form. Properties of the representation are discussed and its advantages illustrated in the development of algorithms for minimizing single-output, binary valued Boolean functions.
更多
查看译文
关键词
boolean function,integer pair representation,binary term,new format,binary terms,non-canonical form,canonical form,testing,boolean functions,sum of products,central processing unit,digital circuits,intellectual property,logic
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要