{"title":"EPGA技术映射中快速匹配布尔函数的表征","authors":"Ulf Schlichtmann, F. Brglez, M. Hermann","doi":"10.1109/DAC.1992.227775","DOIUrl":null,"url":null,"abstract":"The authors introduce characteristic signatures for Boolean functions. The signatures do not exhibit sensitivity to permutations of input variables. These signatures are used to develop a method of rapidly matching subcircuits with cells in a large library. The procedure is analogous to hashing. Filters are discussed that were found to be useful in improving the matching of variables before applying the equivalence verification. Experimental results and the figure of merit of various signatures are outlined.<<ETX>>","PeriodicalId":162648,"journal":{"name":"[1992] Proceedings 29th ACM/IEEE Design Automation Conference","volume":"156 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"36","resultStr":"{\"title\":\"Characterization of Boolean functions for rapid matching in EPGA technology mapping\",\"authors\":\"Ulf Schlichtmann, F. Brglez, M. Hermann\",\"doi\":\"10.1109/DAC.1992.227775\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The authors introduce characteristic signatures for Boolean functions. The signatures do not exhibit sensitivity to permutations of input variables. These signatures are used to develop a method of rapidly matching subcircuits with cells in a large library. The procedure is analogous to hashing. Filters are discussed that were found to be useful in improving the matching of variables before applying the equivalence verification. Experimental results and the figure of merit of various signatures are outlined.<<ETX>>\",\"PeriodicalId\":162648,\"journal\":{\"name\":\"[1992] Proceedings 29th ACM/IEEE Design Automation Conference\",\"volume\":\"156 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1992-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"36\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1992] Proceedings 29th ACM/IEEE Design Automation Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DAC.1992.227775\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1992] Proceedings 29th ACM/IEEE Design Automation Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DAC.1992.227775","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Characterization of Boolean functions for rapid matching in EPGA technology mapping
The authors introduce characteristic signatures for Boolean functions. The signatures do not exhibit sensitivity to permutations of input variables. These signatures are used to develop a method of rapidly matching subcircuits with cells in a large library. The procedure is analogous to hashing. Filters are discussed that were found to be useful in improving the matching of variables before applying the equivalence verification. Experimental results and the figure of merit of various signatures are outlined.<>
![[1992] Proceedings 29th ACM/IEEE Design Automation Conference](/Content/css/sci/img/zetp.jpg)
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
