{"title":"MVL函数的合成-第二部分:蚁群优化方法","authors":"M. Abd El Barr, Bambang A. B. Sarif","doi":"10.1109/ICM.2006.373291","DOIUrl":null,"url":null,"abstract":"In this paper, an ant colony optimization (ACO) based algorithm for synthesis of Multiple-Valued Logic (MVL) functions is proposed. The algorithm is tested using 50000 randomly generated 2-variable 4-valued functions. The proposed approach was compared to the existing direct cover techniques. The results obtained show that the proposed algorithm outperforms other approaches in terms of the average number of product terms required to realize a given MVL function.","PeriodicalId":284717,"journal":{"name":"2006 International Conference on Microelectronics","volume":"11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":"{\"title\":\"Synthesis of MVL Functions - Part II: The Ant Colony Optimization Approach\",\"authors\":\"M. Abd El Barr, Bambang A. B. Sarif\",\"doi\":\"10.1109/ICM.2006.373291\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, an ant colony optimization (ACO) based algorithm for synthesis of Multiple-Valued Logic (MVL) functions is proposed. The algorithm is tested using 50000 randomly generated 2-variable 4-valued functions. The proposed approach was compared to the existing direct cover techniques. The results obtained show that the proposed algorithm outperforms other approaches in terms of the average number of product terms required to realize a given MVL function.\",\"PeriodicalId\":284717,\"journal\":{\"name\":\"2006 International Conference on Microelectronics\",\"volume\":\"11 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"10\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2006 International Conference on Microelectronics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICM.2006.373291\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 International Conference on Microelectronics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICM.2006.373291","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Synthesis of MVL Functions - Part II: The Ant Colony Optimization Approach
In this paper, an ant colony optimization (ACO) based algorithm for synthesis of Multiple-Valued Logic (MVL) functions is proposed. The algorithm is tested using 50000 randomly generated 2-variable 4-valued functions. The proposed approach was compared to the existing direct cover techniques. The results obtained show that the proposed algorithm outperforms other approaches in terms of the average number of product terms required to realize a given MVL function.