标准细胞库的门大小选择

F. Beeftink, P. Kudva, David S. Kung, L. Stok
{"title":"标准细胞库的门大小选择","authors":"F. Beeftink, P. Kudva, David S. Kung, L. Stok","doi":"10.1145/288548.289084","DOIUrl":null,"url":null,"abstract":"The paper presents an algorithm to select a good set of gate sizes for the primitive gates of a standard cell library. A measurement error on a gate is defined to quantify the discrepancy resulting from replacing the size required by a synthesis sizing algorithm with a size available in a discrete cell library. The criterion for gate size selection is a set of gate sizes that minimizes the cumulative error of a prescribed measurement. Optimal solutions to the gate size selection problem targetting size and delay measurements are presented for cases when the probability distribution and the delay equations are simple. A realistic probability distribution is obtained using a sample space of gates derived from a group of designs that is synthesized under the semi-custom synthesis methodology (K. Shepard et al., 1997). A \"delay match\" (minimizing delay error) and a \"size match\" (minimizing size error) set of gate sizes are obtained numerically and are subsequently realized as discrete cell libraries. The previous group of designs are synthesized using the two selected cell libraries and two other cell libraries, one with \"equal spacing\" of cell sizes and the other with \"exponential spacing\" of cell sizes. The \"size match\" library gives the best overall slack and area results.","PeriodicalId":224802,"journal":{"name":"1998 IEEE/ACM International Conference on Computer-Aided Design. Digest of Technical Papers (IEEE Cat. No.98CB36287)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1998-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"50","resultStr":"{\"title\":\"Gate-size selection for standard cell libraries\",\"authors\":\"F. Beeftink, P. Kudva, David S. Kung, L. Stok\",\"doi\":\"10.1145/288548.289084\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The paper presents an algorithm to select a good set of gate sizes for the primitive gates of a standard cell library. A measurement error on a gate is defined to quantify the discrepancy resulting from replacing the size required by a synthesis sizing algorithm with a size available in a discrete cell library. The criterion for gate size selection is a set of gate sizes that minimizes the cumulative error of a prescribed measurement. Optimal solutions to the gate size selection problem targetting size and delay measurements are presented for cases when the probability distribution and the delay equations are simple. A realistic probability distribution is obtained using a sample space of gates derived from a group of designs that is synthesized under the semi-custom synthesis methodology (K. Shepard et al., 1997). A \\\"delay match\\\" (minimizing delay error) and a \\\"size match\\\" (minimizing size error) set of gate sizes are obtained numerically and are subsequently realized as discrete cell libraries. The previous group of designs are synthesized using the two selected cell libraries and two other cell libraries, one with \\\"equal spacing\\\" of cell sizes and the other with \\\"exponential spacing\\\" of cell sizes. The \\\"size match\\\" library gives the best overall slack and area results.\",\"PeriodicalId\":224802,\"journal\":{\"name\":\"1998 IEEE/ACM International Conference on Computer-Aided Design. Digest of Technical Papers (IEEE Cat. No.98CB36287)\",\"volume\":\"4 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1998-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"50\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"1998 IEEE/ACM International Conference on Computer-Aided Design. Digest of Technical Papers (IEEE Cat. No.98CB36287)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/288548.289084\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"1998 IEEE/ACM International Conference on Computer-Aided Design. Digest of Technical Papers (IEEE Cat. No.98CB36287)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/288548.289084","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 50

摘要

本文提出了一种为标准单元库的基元门选择一组合适的门尺寸的算法。门上的测量误差被定义为量化由于用离散单元库中可用的尺寸替换合成尺寸算法所需的尺寸而产生的差异。栅极尺寸选择的标准是使规定测量的累积误差最小化的一组栅极尺寸。在概率分布和时延方程较简单的情况下,给出了门尺寸选择问题的最优解。利用半定制合成方法合成的一组设计的门的样本空间获得了一个现实的概率分布(K. Shepard et al., 1997)。一个“延迟匹配”(最小化延迟误差)和一个“尺寸匹配”(最小化尺寸误差)的门尺寸集被数值化并随后被实现为离散单元库。前一组设计是使用两个选定的细胞库和另外两个细胞库合成的,一个具有“等间距”的细胞大小,另一个具有“指数间距”的细胞大小。“大小匹配”库提供了最好的整体松弛和面积结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Gate-size selection for standard cell libraries
The paper presents an algorithm to select a good set of gate sizes for the primitive gates of a standard cell library. A measurement error on a gate is defined to quantify the discrepancy resulting from replacing the size required by a synthesis sizing algorithm with a size available in a discrete cell library. The criterion for gate size selection is a set of gate sizes that minimizes the cumulative error of a prescribed measurement. Optimal solutions to the gate size selection problem targetting size and delay measurements are presented for cases when the probability distribution and the delay equations are simple. A realistic probability distribution is obtained using a sample space of gates derived from a group of designs that is synthesized under the semi-custom synthesis methodology (K. Shepard et al., 1997). A "delay match" (minimizing delay error) and a "size match" (minimizing size error) set of gate sizes are obtained numerically and are subsequently realized as discrete cell libraries. The previous group of designs are synthesized using the two selected cell libraries and two other cell libraries, one with "equal spacing" of cell sizes and the other with "exponential spacing" of cell sizes. The "size match" library gives the best overall slack and area results.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信