网络优化的并发再合成

[1991 Proceedings] IEEE International Conference on Computer Design: VLSI in Computers and Processors Pub Date : 1991-10-14 DOI:10.1109/ICCD.1991.139841

Kuang-Chien Chen, M. Fujita

{"title":"网络优化的并发再合成","authors":"Kuang-Chien Chen, M. Fujita","doi":"10.1109/ICCD.1991.139841","DOIUrl":null,"url":null,"abstract":"An algorithm called C-RENO (Concurrent Resynthesis for Network Optimization) is presented for the optimization of multilevel combinational networks. In C-RENO, a given network is optimized for global optimality by resynthesizing a set of gates concurrently, using other gates in the network. C-RENO uses the generalized ratio-set algorithm, which enables one to resynthesize complex gates instead of only simple gates (e.g. NAND and NOR), exploring larger reconfiguration space. High-quality networks are derived by C-RENO even if no network don't-cares are used, and results which are not achievable by other methods have been obtained.<<ETX>>","PeriodicalId":239827,"journal":{"name":"[1991 Proceedings] IEEE International Conference on Computer Design: VLSI in Computers and Processors","volume":"31 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1991-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Concurrent resynthesis for network optimization\",\"authors\":\"Kuang-Chien Chen, M. Fujita\",\"doi\":\"10.1109/ICCD.1991.139841\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"An algorithm called C-RENO (Concurrent Resynthesis for Network Optimization) is presented for the optimization of multilevel combinational networks. In C-RENO, a given network is optimized for global optimality by resynthesizing a set of gates concurrently, using other gates in the network. C-RENO uses the generalized ratio-set algorithm, which enables one to resynthesize complex gates instead of only simple gates (e.g. NAND and NOR), exploring larger reconfiguration space. High-quality networks are derived by C-RENO even if no network don't-cares are used, and results which are not achievable by other methods have been obtained.<<ETX>>\",\"PeriodicalId\":239827,\"journal\":{\"name\":\"[1991 Proceedings] IEEE International Conference on Computer Design: VLSI in Computers and Processors\",\"volume\":\"31 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1991-10-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1991 Proceedings] IEEE International Conference on Computer Design: VLSI in Computers and Processors\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCD.1991.139841\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1991 Proceedings] IEEE International Conference on Computer Design: VLSI in Computers and Processors","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCD.1991.139841","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 3

摘要

提出了一种用于多层组合网络优化的C-RENO (Concurrent Resynthesis for Network Optimization)算法。在C-RENO中，通过使用网络中的其他门并发地重新合成一组门来优化给定网络的全局最优性。C-RENO采用了广义比率集算法，使得人们可以重新合成复杂的门，而不仅仅是简单的门(如NAND和NOR)，探索更大的重构空间。C-RENO在不使用网络不在乎的情况下也能得到高质量的网络，并获得了其他方法无法达到的结果。

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

查看原文本刊更多论文

Concurrent resynthesis for network optimization

An algorithm called C-RENO (Concurrent Resynthesis for Network Optimization) is presented for the optimization of multilevel combinational networks. In C-RENO, a given network is optimized for global optimality by resynthesizing a set of gates concurrently, using other gates in the network. C-RENO uses the generalized ratio-set algorithm, which enables one to resynthesize complex gates instead of only simple gates (e.g. NAND and NOR), exploring larger reconfiguration space. High-quality networks are derived by C-RENO even if no network don't-cares are used, and results which are not achievable by other methods have been obtained.<>

求助全文

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

来源期刊

[1991 Proceedings] IEEE International Conference on Computer Design: VLSI in Computers and Processors

自引率

0.00%

发文量