{"title":"多阈值门限门的合成","authors":"Maciej Nikodem, Marek A. Bawiec, J. Biernat","doi":"10.1109/ISVLSI.2012.58","DOIUrl":null,"url":null,"abstract":"This paper presents novel synthesis algorithm capable of generating Multithreshold Threshold Gate (MTTG) structure for arbitrary Boolean function. Algorithm draws from dedicated efficient threshold decomposition procedure that represents Boolean function as a min/max composition of threshold functions. Since the proposed threshold decomposition procedure outputs minimal number of thresholds therefore the resulting gate is compact - for k-threshold n-input Boolean function at most (k+1)(n+1) NDR elements in a (k+1)-level gate structure, and (k+1)n transistors are required.","PeriodicalId":398850,"journal":{"name":"2012 IEEE Computer Society Annual Symposium on VLSI","volume":"9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Synthesis of Multithreshold Threshold Gates\",\"authors\":\"Maciej Nikodem, Marek A. Bawiec, J. Biernat\",\"doi\":\"10.1109/ISVLSI.2012.58\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents novel synthesis algorithm capable of generating Multithreshold Threshold Gate (MTTG) structure for arbitrary Boolean function. Algorithm draws from dedicated efficient threshold decomposition procedure that represents Boolean function as a min/max composition of threshold functions. Since the proposed threshold decomposition procedure outputs minimal number of thresholds therefore the resulting gate is compact - for k-threshold n-input Boolean function at most (k+1)(n+1) NDR elements in a (k+1)-level gate structure, and (k+1)n transistors are required.\",\"PeriodicalId\":398850,\"journal\":{\"name\":\"2012 IEEE Computer Society Annual Symposium on VLSI\",\"volume\":\"9 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-08-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 IEEE Computer Society Annual Symposium on VLSI\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISVLSI.2012.58\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 IEEE Computer Society Annual Symposium on VLSI","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISVLSI.2012.58","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
This paper presents novel synthesis algorithm capable of generating Multithreshold Threshold Gate (MTTG) structure for arbitrary Boolean function. Algorithm draws from dedicated efficient threshold decomposition procedure that represents Boolean function as a min/max composition of threshold functions. Since the proposed threshold decomposition procedure outputs minimal number of thresholds therefore the resulting gate is compact - for k-threshold n-input Boolean function at most (k+1)(n+1) NDR elements in a (k+1)-level gate structure, and (k+1)n transistors are required.