B. Ilyin, A. Kazimirov, V. Panteleyev, S. Y. Reimerov, N. Semicheva
{"title":"布尔函数最小化的进化算法","authors":"B. Ilyin, A. Kazimirov, V. Panteleyev, S. Y. Reimerov, N. Semicheva","doi":"10.1109/SCM.2017.7970598","DOIUrl":null,"url":null,"abstract":"This paper concerns evolutionary algorithms for minimization exclusive-or sum-of-products representations of Boolean functions. These representations are used in logic synthesis for certain class of circuits. Minimization is based on a decomposition for Boolean functions with parameter function. Selection of this function is a search task which can be solved with evolutionary algorithms. Algorithms for obtaining approximately minimal formulas for Boolean functions of up to 8 variables are proposed.","PeriodicalId":315574,"journal":{"name":"2017 XX IEEE International Conference on Soft Computing and Measurements (SCM)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"On evolutionary algorithms for Boolean functions minimization\",\"authors\":\"B. Ilyin, A. Kazimirov, V. Panteleyev, S. Y. Reimerov, N. Semicheva\",\"doi\":\"10.1109/SCM.2017.7970598\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper concerns evolutionary algorithms for minimization exclusive-or sum-of-products representations of Boolean functions. These representations are used in logic synthesis for certain class of circuits. Minimization is based on a decomposition for Boolean functions with parameter function. Selection of this function is a search task which can be solved with evolutionary algorithms. Algorithms for obtaining approximately minimal formulas for Boolean functions of up to 8 variables are proposed.\",\"PeriodicalId\":315574,\"journal\":{\"name\":\"2017 XX IEEE International Conference on Soft Computing and Measurements (SCM)\",\"volume\":\"32 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-05-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 XX IEEE International Conference on Soft Computing and Measurements (SCM)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SCM.2017.7970598\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 XX IEEE International Conference on Soft Computing and Measurements (SCM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SCM.2017.7970598","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
On evolutionary algorithms for Boolean functions minimization
This paper concerns evolutionary algorithms for minimization exclusive-or sum-of-products representations of Boolean functions. These representations are used in logic synthesis for certain class of circuits. Minimization is based on a decomposition for Boolean functions with parameter function. Selection of this function is a search task which can be solved with evolutionary algorithms. Algorithms for obtaining approximately minimal formulas for Boolean functions of up to 8 variables are proposed.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
