{"title":"okfdd中变量排序与分解类型选择","authors":"R. Drechsler, B. Becker, A. Jahnke","doi":"10.1109/ASPDAC.1995.486406","DOIUrl":null,"url":null,"abstract":"We present methods for the construction of small ordered Kronecker functional decision diagrams (OKFDDs). OKFDDs are a generalization of ordered binary decision diagrams (OBDDs) and ordered functional decision diagrams (OFDDs) as well. Starting with an upper bound for the size of an OKFDD representing a tree like circuit, we develop different heuristics to find good variable orderings and decomposition types for OKFDDs representing two level and multi level circuits, respectively. Experimental results are presented to show the efficiency of our approaches.","PeriodicalId":119232,"journal":{"name":"Proceedings of ASP-DAC'95/CHDL'95/VLSI'95 with EDA Technofair","volume":"45 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1995-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"29","resultStr":"{\"title\":\"On variable ordering and decomposition type choice in OKFDDs\",\"authors\":\"R. Drechsler, B. Becker, A. Jahnke\",\"doi\":\"10.1109/ASPDAC.1995.486406\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We present methods for the construction of small ordered Kronecker functional decision diagrams (OKFDDs). OKFDDs are a generalization of ordered binary decision diagrams (OBDDs) and ordered functional decision diagrams (OFDDs) as well. Starting with an upper bound for the size of an OKFDD representing a tree like circuit, we develop different heuristics to find good variable orderings and decomposition types for OKFDDs representing two level and multi level circuits, respectively. Experimental results are presented to show the efficiency of our approaches.\",\"PeriodicalId\":119232,\"journal\":{\"name\":\"Proceedings of ASP-DAC'95/CHDL'95/VLSI'95 with EDA Technofair\",\"volume\":\"45 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1995-08-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"29\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of ASP-DAC'95/CHDL'95/VLSI'95 with EDA Technofair\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ASPDAC.1995.486406\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of ASP-DAC'95/CHDL'95/VLSI'95 with EDA Technofair","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ASPDAC.1995.486406","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
On variable ordering and decomposition type choice in OKFDDs
We present methods for the construction of small ordered Kronecker functional decision diagrams (OKFDDs). OKFDDs are a generalization of ordered binary decision diagrams (OBDDs) and ordered functional decision diagrams (OFDDs) as well. Starting with an upper bound for the size of an OKFDD representing a tree like circuit, we develop different heuristics to find good variable orderings and decomposition types for OKFDDs representing two level and multi level circuits, respectively. Experimental results are presented to show the efficiency of our approaches.