二进制项和方程的整数对表示

A.J. Diaz, M. Jiménez, E. Strangas, M. Shanblatt
{"title":"二进制项和方程的整数对表示","authors":"A.J. Diaz, M. Jiménez, E. Strangas, M. Shanblatt","doi":"10.1109/MWSCAS.1998.759462","DOIUrl":null,"url":null,"abstract":"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.","PeriodicalId":338994,"journal":{"name":"1998 Midwest Symposium on Circuits and Systems (Cat. No. 98CB36268)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1998-08-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Integer pair representation of binary terms and equations\",\"authors\":\"A.J. Diaz, M. Jiménez, E. Strangas, M. Shanblatt\",\"doi\":\"10.1109/MWSCAS.1998.759462\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"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.\",\"PeriodicalId\":338994,\"journal\":{\"name\":\"1998 Midwest Symposium on Circuits and Systems (Cat. No. 98CB36268)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1998-08-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"1998 Midwest Symposium on Circuits and Systems (Cat. No. 98CB36268)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MWSCAS.1998.759462\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"1998 Midwest Symposium on Circuits and Systems (Cat. No. 98CB36268)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MWSCAS.1998.759462","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

提出了一种用布尔函数表示二进制项的新格式——整数对表示法(IPR)。这种格式使用有序的整数对来紧凑地表示布尔函数的每个立方体,布尔函数以规范或非规范形式写成乘积和。讨论了这种表示的性质,并说明了它在求解单输出、二进制值布尔函数的最小化算法中的优点。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Integer pair representation of binary terms and equations
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信