{"title":"一种基于成本表的四值一元函数合成新技术,采用电流型CMOS电路实现","authors":"M. Abd-El-Barr, A. Al-Mutawa","doi":"10.1109/ISMVL.2001.924549","DOIUrl":null,"url":null,"abstract":"In this paper, we introduce a new improved cost-table-based technique for synthesis of 4-valued one-variable functions for implementation using current-mode CMOS (CMCL) circuits. The technique uses a cost-table consisting of 38 positive functions and 10 negative functions as input. The algorithm used to synthesize all 256 4-valued unary functions proceeds as follows. In each step, the algorithm selectively adds two functions from those accumulated so far in the table. If the newly formed function exists in the table at a higher cost, then the function just formed will replace the existing one; otherwise the formed function will be ignored and the process repeats. The obtained results show that the maximum cost of any function is 17 compared to 19 using a previously introduced algorithm. The average cost per function is 9.54 compared to 10.41. Lower cost is achieved in synthesizing 157 (60%) functions using the proposed technique compared to our previously introduced technique.","PeriodicalId":297353,"journal":{"name":"Proceedings 31st IEEE International Symposium on Multiple-Valued Logic","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"A new improved cost-table-based technique for synthesis of 4-valued unary functions implemented using current-mode CMOS circuits\",\"authors\":\"M. Abd-El-Barr, A. Al-Mutawa\",\"doi\":\"10.1109/ISMVL.2001.924549\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we introduce a new improved cost-table-based technique for synthesis of 4-valued one-variable functions for implementation using current-mode CMOS (CMCL) circuits. The technique uses a cost-table consisting of 38 positive functions and 10 negative functions as input. The algorithm used to synthesize all 256 4-valued unary functions proceeds as follows. In each step, the algorithm selectively adds two functions from those accumulated so far in the table. If the newly formed function exists in the table at a higher cost, then the function just formed will replace the existing one; otherwise the formed function will be ignored and the process repeats. The obtained results show that the maximum cost of any function is 17 compared to 19 using a previously introduced algorithm. The average cost per function is 9.54 compared to 10.41. Lower cost is achieved in synthesizing 157 (60%) functions using the proposed technique compared to our previously introduced technique.\",\"PeriodicalId\":297353,\"journal\":{\"name\":\"Proceedings 31st IEEE International Symposium on Multiple-Valued Logic\",\"volume\":\"8 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2001-05-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings 31st IEEE International Symposium on Multiple-Valued Logic\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISMVL.2001.924549\",\"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 31st IEEE International Symposium on Multiple-Valued Logic","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISMVL.2001.924549","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A new improved cost-table-based technique for synthesis of 4-valued unary functions implemented using current-mode CMOS circuits
In this paper, we introduce a new improved cost-table-based technique for synthesis of 4-valued one-variable functions for implementation using current-mode CMOS (CMCL) circuits. The technique uses a cost-table consisting of 38 positive functions and 10 negative functions as input. The algorithm used to synthesize all 256 4-valued unary functions proceeds as follows. In each step, the algorithm selectively adds two functions from those accumulated so far in the table. If the newly formed function exists in the table at a higher cost, then the function just formed will replace the existing one; otherwise the formed function will be ignored and the process repeats. The obtained results show that the maximum cost of any function is 17 compared to 19 using a previously introduced algorithm. The average cost per function is 9.54 compared to 10.41. Lower cost is achieved in synthesizing 157 (60%) functions using the proposed technique compared to our previously introduced technique.