{"title":"BDD变量排序实验设计:经验教训","authors":"J. Harlow, F. Brglez","doi":"10.1145/288548.289103","DOIUrl":null,"url":null,"abstract":"Applying the design of experiments methodology to the evaluation of BDD variable ordering algorithms has yielded a number of conclusive results. The methodology relies on the equivalence classes of functionally perturbed circuits that maintain logic invariance, or are within (1, 2, ...)-minterms of the original reference circuit function, also maintaining entropy-invariance. For some of the current variable ordering algorithms and tools, the negative results include: statistically significant sensitivity to naming of variables; confirmation that a number of variable ordering algorithms are statistically equivalent to a random variable order assignment; and observation of a statistically anomalous variable ordering behavior of a well known benchmark circuit isomorphic class when analyzed under single and multiple outputs. On the positive side, the methodology supports a statistically significant merit evaluation of any newly introduced variable ordering algorithm, including the one briefly introduced in this paper.","PeriodicalId":224802,"journal":{"name":"1998 IEEE/ACM International Conference on Computer-Aided Design. Digest of Technical Papers (IEEE Cat. No.98CB36287)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1998-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"34","resultStr":"{\"title\":\"Design of experiments in BDD variable ordering: lessons learned\",\"authors\":\"J. Harlow, F. Brglez\",\"doi\":\"10.1145/288548.289103\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Applying the design of experiments methodology to the evaluation of BDD variable ordering algorithms has yielded a number of conclusive results. The methodology relies on the equivalence classes of functionally perturbed circuits that maintain logic invariance, or are within (1, 2, ...)-minterms of the original reference circuit function, also maintaining entropy-invariance. For some of the current variable ordering algorithms and tools, the negative results include: statistically significant sensitivity to naming of variables; confirmation that a number of variable ordering algorithms are statistically equivalent to a random variable order assignment; and observation of a statistically anomalous variable ordering behavior of a well known benchmark circuit isomorphic class when analyzed under single and multiple outputs. On the positive side, the methodology supports a statistically significant merit evaluation of any newly introduced variable ordering algorithm, including the one briefly introduced in this paper.\",\"PeriodicalId\":224802,\"journal\":{\"name\":\"1998 IEEE/ACM International Conference on Computer-Aided Design. Digest of Technical Papers (IEEE Cat. No.98CB36287)\",\"volume\":\"28 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1998-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"34\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"1998 IEEE/ACM International Conference on Computer-Aided Design. Digest of Technical Papers (IEEE Cat. No.98CB36287)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/288548.289103\",\"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 IEEE/ACM International Conference on Computer-Aided Design. Digest of Technical Papers (IEEE Cat. No.98CB36287)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/288548.289103","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Design of experiments in BDD variable ordering: lessons learned
Applying the design of experiments methodology to the evaluation of BDD variable ordering algorithms has yielded a number of conclusive results. The methodology relies on the equivalence classes of functionally perturbed circuits that maintain logic invariance, or are within (1, 2, ...)-minterms of the original reference circuit function, also maintaining entropy-invariance. For some of the current variable ordering algorithms and tools, the negative results include: statistically significant sensitivity to naming of variables; confirmation that a number of variable ordering algorithms are statistically equivalent to a random variable order assignment; and observation of a statistically anomalous variable ordering behavior of a well known benchmark circuit isomorphic class when analyzed under single and multiple outputs. On the positive side, the methodology supports a statistically significant merit evaluation of any newly introduced variable ordering algorithm, including the one briefly introduced in this paper.