一种基于模拟退火的状态分配控制综合方法

B. Mitra, S. Jha, P.P. Choudhuri
{"title":"一种基于模拟退火的状态分配控制综合方法","authors":"B. Mitra, S. Jha, P.P. Choudhuri","doi":"10.1109/ISVD.1991.185091","DOIUrl":null,"url":null,"abstract":"The optimality of synthesized control designs for complex VLSI systems hinges to a great extent on the efficiency of the state assignment phase. A new system is presented for state assignment of sequential functions modelled as finite state machines. Using a simulated annealing technique and an embedded mechanism to vary the state assignment length, this scheme arrives at a synthesized logic that is efficient in terms of area occupied by both the memory elements and the combinational logic. This is in contrast to most existing methods for state assignment that use minimum code length to ensure least cost of sequential logic. Appropriate annealing schedules, perturbation functions and grouping of state codes for efficient state assignment have been arrived at. The authors present results that indicate that it is possible to achieve significant improvements in both the area and delay of the combinational logic by increasing the code length. A mechanism has also been incorporated in the system for expert designers to specify their own state assignments. Developed at Texas Instruments, this technique has been found to give encouraging results on several large and realistic designs.<<ETX>>","PeriodicalId":183602,"journal":{"name":"[1991] Proceedings. Fourth CSI/IEEE International Symposium on VLSI Design","volume":"29 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1991-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"A simulated annealing based state assignment approach for control synthesis\",\"authors\":\"B. Mitra, S. Jha, P.P. Choudhuri\",\"doi\":\"10.1109/ISVD.1991.185091\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The optimality of synthesized control designs for complex VLSI systems hinges to a great extent on the efficiency of the state assignment phase. A new system is presented for state assignment of sequential functions modelled as finite state machines. Using a simulated annealing technique and an embedded mechanism to vary the state assignment length, this scheme arrives at a synthesized logic that is efficient in terms of area occupied by both the memory elements and the combinational logic. This is in contrast to most existing methods for state assignment that use minimum code length to ensure least cost of sequential logic. Appropriate annealing schedules, perturbation functions and grouping of state codes for efficient state assignment have been arrived at. The authors present results that indicate that it is possible to achieve significant improvements in both the area and delay of the combinational logic by increasing the code length. A mechanism has also been incorporated in the system for expert designers to specify their own state assignments. Developed at Texas Instruments, this technique has been found to give encouraging results on several large and realistic designs.<<ETX>>\",\"PeriodicalId\":183602,\"journal\":{\"name\":\"[1991] Proceedings. Fourth CSI/IEEE International Symposium on VLSI Design\",\"volume\":\"29 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1991-01-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1991] Proceedings. Fourth CSI/IEEE International Symposium on VLSI Design\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISVD.1991.185091\",\"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. Fourth CSI/IEEE International Symposium on VLSI Design","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISVD.1991.185091","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

摘要

复杂VLSI系统综合控制设计的最优性在很大程度上取决于状态分配阶段的效率。提出了一种以有限状态机为模型的序列函数状态分配新方法。该方案采用模拟退火技术和嵌入式机制来改变状态分配长度,从而得到一种既节省存储单元面积又节省组合逻辑面积的综合逻辑。这与大多数现有的状态分配方法形成对比,这些方法使用最小的代码长度来确保顺序逻辑的最小成本。得到了适当的退火程序、扰动函数和状态码分组,以实现有效的状态分配。作者提出的结果表明,可以通过增加代码长度来显著改善组合逻辑的面积和延迟。系统中还加入了一种机制,让专家设计师指定自己的状态任务。这项技术是由德州仪器公司开发的,已经在几个大型和现实的设计中得到了令人鼓舞的结果
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A simulated annealing based state assignment approach for control synthesis
The optimality of synthesized control designs for complex VLSI systems hinges to a great extent on the efficiency of the state assignment phase. A new system is presented for state assignment of sequential functions modelled as finite state machines. Using a simulated annealing technique and an embedded mechanism to vary the state assignment length, this scheme arrives at a synthesized logic that is efficient in terms of area occupied by both the memory elements and the combinational logic. This is in contrast to most existing methods for state assignment that use minimum code length to ensure least cost of sequential logic. Appropriate annealing schedules, perturbation functions and grouping of state codes for efficient state assignment have been arrived at. The authors present results that indicate that it is possible to achieve significant improvements in both the area and delay of the combinational logic by increasing the code length. A mechanism has also been incorporated in the system for expert designers to specify their own state assignments. Developed at Texas Instruments, this technique has been found to give encouraging results on several large and realistic designs.<>
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信