基于三元通用逻辑模块U/sub / f/的快速逻辑综合

[1992] Proceedings The Twenty-Second International Symposium on Multiple-Valued Logic Pub Date : 1992-05-27 DOI:10.1109/ISMVL.1992.186823

B. Fei, N. Zhuang

{"title":"基于三元通用逻辑模块U/sub / f/的快速逻辑综合","authors":"B. Fei, N. Zhuang","doi":"10.1109/ISMVL.1992.186823","DOIUrl":null,"url":null,"abstract":"A fast algorithm for logic synthesis based on U/sub f/ (a ternary Reed-Muller universal logic module) is presented. Using this algorithm, the optimum or suboptimum synthesis scheme for n-variable logic functions can be located using pseudoexhaustive search of time (n+2)(n-1)/2.<<ETX>>","PeriodicalId":127091,"journal":{"name":"[1992] Proceedings The Twenty-Second International Symposium on Multiple-Valued Logic","volume":"42 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Fast logic synthesis based upon ternary universal logic module U/sub f/\",\"authors\":\"B. Fei, N. Zhuang\",\"doi\":\"10.1109/ISMVL.1992.186823\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A fast algorithm for logic synthesis based on U/sub f/ (a ternary Reed-Muller universal logic module) is presented. Using this algorithm, the optimum or suboptimum synthesis scheme for n-variable logic functions can be located using pseudoexhaustive search of time (n+2)(n-1)/2.<<ETX>>\",\"PeriodicalId\":127091,\"journal\":{\"name\":\"[1992] Proceedings The Twenty-Second International Symposium on Multiple-Valued Logic\",\"volume\":\"42 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1992-05-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1992] Proceedings The Twenty-Second International Symposium on Multiple-Valued Logic\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISMVL.1992.186823\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1992] Proceedings The Twenty-Second International Symposium on Multiple-Valued Logic","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISMVL.1992.186823","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 2

摘要

提出了一种基于U/sub / f/(三元Reed-Muller通用逻辑模块)的快速逻辑综合算法。利用该算法，利用时间为(n+2)(n-1)/2的伪穷举搜索，可以找到n变量逻辑函数的最优或次优综合方案。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Fast logic synthesis based upon ternary universal logic module U/sub f/

A fast algorithm for logic synthesis based on U/sub f/ (a ternary Reed-Muller universal logic module) is presented. Using this algorithm, the optimum or suboptimum synthesis scheme for n-variable logic functions can be located using pseudoexhaustive search of time (n+2)(n-1)/2.<>

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

[1992] Proceedings The Twenty-Second International Symposium on Multiple-Valued Logic

自引率

0.00%

发文量