Iterative remapping respecting timing constraints

Lucas Machado, Mayler G. A. Martins, V. Callegaro, Renato P. Ribas, A. Reis
{"title":"Iterative remapping respecting timing constraints","authors":"Lucas Machado, Mayler G. A. Martins, V. Callegaro, Renato P. Ribas, A. Reis","doi":"10.1109/ISVLSI.2013.6654639","DOIUrl":null,"url":null,"abstract":"This paper proposes a novel iterative remapping approach for area reduction while still respecting the timing constraints of the design specification. The use of complex gates can potentially reduce cell area, but they have to be chosen wisely to preserve timing constraints while remapping. Commercial tools for logic synthesis work better with simple cells and are not fully capable of taking advantage of complex cells; the strategy proposed herein is aimed to better exploit complex cells during technology mapping. The proposed iterative remapping approach can exploit a larger amount of logic gates, reducing global circuit area and respecting global timing constraints. Experiments show area improvement of 8% on average and up to 15% for a subset of combinational mapped circuits of IWLS 2005 benchmarks.","PeriodicalId":439122,"journal":{"name":"2013 IEEE Computer Society Annual Symposium on VLSI (ISVLSI)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 IEEE Computer Society Annual Symposium on VLSI (ISVLSI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISVLSI.2013.6654639","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

Abstract

This paper proposes a novel iterative remapping approach for area reduction while still respecting the timing constraints of the design specification. The use of complex gates can potentially reduce cell area, but they have to be chosen wisely to preserve timing constraints while remapping. Commercial tools for logic synthesis work better with simple cells and are not fully capable of taking advantage of complex cells; the strategy proposed herein is aimed to better exploit complex cells during technology mapping. The proposed iterative remapping approach can exploit a larger amount of logic gates, reducing global circuit area and respecting global timing constraints. Experiments show area improvement of 8% on average and up to 15% for a subset of combinational mapped circuits of IWLS 2005 benchmarks.
尊重时间约束的迭代重新映射
本文提出了一种新的迭代重映射方法来减少面积,同时仍然尊重设计规范的时间约束。使用复杂门可以潜在地减少细胞面积,但是必须明智地选择它们,以便在重新映射时保持时间限制。用于逻辑合成的商业工具可以更好地处理简单的细胞,而不能完全利用复杂的细胞;本文提出的策略旨在更好地利用技术映射过程中的复杂细胞。所提出的迭代重映射方法可以利用大量的逻辑门,减少全局电路面积并尊重全局时序约束。实验表明,IWLS 2005基准的组合映射电路子集的面积平均提高了8%,最高可达15%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信