单通量量子逻辑电路中齐次三叶草时钟网络层次链的时钟合成算法

S. Shahsavani, R. Tadros, P. Beerel, M. Pedram
{"title":"单通量量子逻辑电路中齐次三叶草时钟网络层次链的时钟合成算法","authors":"S. Shahsavani, R. Tadros, P. Beerel, M. Pedram","doi":"10.1109/ISEC46533.2019.8990945","DOIUrl":null,"url":null,"abstract":"Single Flux Quantum (SFQ) is a promising option for high performance and low power supercomputing platforms. Nevertheless, timing uncertainty represents an obstacle to the design of high-frequency clock distribution networks. The hierarchical chains of homogeneous clover-leaves clocking, $(\\mathrm{HC})^{2}\\mathrm{LC}$. was proposed as an innovative solution to this challenge. This paper presents a novel algorithm for the physical implementation of $(\\mathrm{HC})^{2}\\mathrm{LC}$ networks. The proposed method models the (HC)2LC network as a directed graph with multiple cycles representing the synchronizing feedback signals. This graph is then transformed to a directed acyclic graph (DAG) by eliminating feedback edges. The physical location of the nodes in the generated DAG (such as splitters and C-junctions) in the Manhattan plane is calculated using a zero-skew clock embedding algorithm. Additionally, a novel mixed integer linear programming (MILP) based approach minimizes the maximum clock skew among the sinks of the clock network and the sum of the delay of the edges in feedback loops, simultaneously. Experimental results show that using the proposed approach, the average clock skew for five benchmark circuits is 4.6ps.","PeriodicalId":250606,"journal":{"name":"2019 IEEE International Superconductive Electronics Conference (ISEC)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A Clock Synthesis Algorithm for Hierarchical Chains of Homogeneous Clover-Leaves Clock Networks for Single Flux Quantum Logic Circuits\",\"authors\":\"S. Shahsavani, R. Tadros, P. Beerel, M. Pedram\",\"doi\":\"10.1109/ISEC46533.2019.8990945\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Single Flux Quantum (SFQ) is a promising option for high performance and low power supercomputing platforms. Nevertheless, timing uncertainty represents an obstacle to the design of high-frequency clock distribution networks. The hierarchical chains of homogeneous clover-leaves clocking, $(\\\\mathrm{HC})^{2}\\\\mathrm{LC}$. was proposed as an innovative solution to this challenge. This paper presents a novel algorithm for the physical implementation of $(\\\\mathrm{HC})^{2}\\\\mathrm{LC}$ networks. The proposed method models the (HC)2LC network as a directed graph with multiple cycles representing the synchronizing feedback signals. This graph is then transformed to a directed acyclic graph (DAG) by eliminating feedback edges. The physical location of the nodes in the generated DAG (such as splitters and C-junctions) in the Manhattan plane is calculated using a zero-skew clock embedding algorithm. Additionally, a novel mixed integer linear programming (MILP) based approach minimizes the maximum clock skew among the sinks of the clock network and the sum of the delay of the edges in feedback loops, simultaneously. Experimental results show that using the proposed approach, the average clock skew for five benchmark circuits is 4.6ps.\",\"PeriodicalId\":250606,\"journal\":{\"name\":\"2019 IEEE International Superconductive Electronics Conference (ISEC)\",\"volume\":\"11 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 IEEE International Superconductive Electronics Conference (ISEC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISEC46533.2019.8990945\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE International Superconductive Electronics Conference (ISEC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISEC46533.2019.8990945","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

单通量量子(SFQ)是高性能和低功耗超级计算平台的一个有前途的选择。然而,时间的不确定性是高频时钟分配网络设计的一个障碍。齐次三叶草叶时钟的层次链,$(\ mathm {HC})^{2}\ mathm {LC}$。作为应对这一挑战的创新解决方案。本文提出了一种新的$(\ mathm {HC})^{2}\ mathm {LC}$网络物理实现算法。该方法将(HC)2LC网络建模为一个有向图,其中多个环表示同步反馈信号。然后通过消除反馈边将该图转换为有向无环图(DAG)。生成的DAG中节点(如分裂器和c -结)在曼哈顿平面中的物理位置是使用零倾斜时钟嵌入算法计算的。此外,一种新颖的基于混合整数线性规划(MILP)的方法同时最小化时钟网络sink之间的最大时钟偏差和反馈环路中边的延迟总和。实验结果表明,采用该方法,5个基准电路的平均时钟偏差为4.6ps。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A Clock Synthesis Algorithm for Hierarchical Chains of Homogeneous Clover-Leaves Clock Networks for Single Flux Quantum Logic Circuits
Single Flux Quantum (SFQ) is a promising option for high performance and low power supercomputing platforms. Nevertheless, timing uncertainty represents an obstacle to the design of high-frequency clock distribution networks. The hierarchical chains of homogeneous clover-leaves clocking, $(\mathrm{HC})^{2}\mathrm{LC}$. was proposed as an innovative solution to this challenge. This paper presents a novel algorithm for the physical implementation of $(\mathrm{HC})^{2}\mathrm{LC}$ networks. The proposed method models the (HC)2LC network as a directed graph with multiple cycles representing the synchronizing feedback signals. This graph is then transformed to a directed acyclic graph (DAG) by eliminating feedback edges. The physical location of the nodes in the generated DAG (such as splitters and C-junctions) in the Manhattan plane is calculated using a zero-skew clock embedding algorithm. Additionally, a novel mixed integer linear programming (MILP) based approach minimizes the maximum clock skew among the sinks of the clock network and the sum of the delay of the edges in feedback loops, simultaneously. Experimental results show that using the proposed approach, the average clock skew for five benchmark circuits is 4.6ps.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
qEC: A Logical Equivalence Checking Framework Targeting SFQ Superconducting Circuits Noise Contribution to Switching Current Distributions in NbN Nanowires An Automated Place and Route Methodology for Asynchronous SFQ Circuit Design Design of Datapath Circuits for a Bit-Parallel 8-bit RSFQ Microprocessor Series Arrays of Long Josephson Junctions Fabricated with a Focused Helium Ion Beam in YBa2Cu3O7-δ
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1