{"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}
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.