Fast RSFQ and ERSFQ Parallel Counters

M. E. Çelik, T. Filippov, A. Sahu, D. Kirichenko, S. Sarwana, A. E. Lehmann, D. Gupta
{"title":"Fast RSFQ and ERSFQ Parallel Counters","authors":"M. E. Çelik, T. Filippov, A. Sahu, D. Kirichenko, S. Sarwana, A. E. Lehmann, D. Gupta","doi":"10.1109/ISEC46533.2019.8990923","DOIUrl":null,"url":null,"abstract":"Historically one of the most challenging high-speed RSFQ circuits to implement has been a parallel counter that sums a set of unweighted inputs and produces a binary-weighted word at the same clock rate. A 7-to-3 parallel counter that sums 7 inputs has been designed and tested at clock frequencies up to 50 GHz using its own dedicated testbed. Yielded in both 10- and 20-kA/cm2 current densities using MIT Lincoln Laboratory's foundry, this 7-to-3 summing circuit has become a digital circuit benchmark. Most recently, a version with 15 parallel inputs producing a 4-bit output was designed using two flavors of 8-to-4 summing circuits. The first (8-to-4a), based on the 7-to-3 parallel counter, sums 8 unweighted inputs whereas the second (8-to-4b) sums two 4-bit binary-weighted words by pairwise summing of bits of equal weights from two 8-to-4a blocks. Design considerations for scaling this circuit will be discussed together with the circuit performance and yield.","PeriodicalId":250606,"journal":{"name":"2019 IEEE International Superconductive Electronics Conference (ISEC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE International Superconductive Electronics Conference (ISEC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISEC46533.2019.8990923","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

Historically one of the most challenging high-speed RSFQ circuits to implement has been a parallel counter that sums a set of unweighted inputs and produces a binary-weighted word at the same clock rate. A 7-to-3 parallel counter that sums 7 inputs has been designed and tested at clock frequencies up to 50 GHz using its own dedicated testbed. Yielded in both 10- and 20-kA/cm2 current densities using MIT Lincoln Laboratory's foundry, this 7-to-3 summing circuit has become a digital circuit benchmark. Most recently, a version with 15 parallel inputs producing a 4-bit output was designed using two flavors of 8-to-4 summing circuits. The first (8-to-4a), based on the 7-to-3 parallel counter, sums 8 unweighted inputs whereas the second (8-to-4b) sums two 4-bit binary-weighted words by pairwise summing of bits of equal weights from two 8-to-4a blocks. Design considerations for scaling this circuit will be discussed together with the circuit performance and yield.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
快速RSFQ和ERSFQ并行计数器
历史上最具挑战性的高速RSFQ电路之一是一个并行计数器,它对一组未加权输入求和,并以相同的时钟速率产生二进制加权单词。设计了一个7对3并行计数器,该计数器将7个输入加起来,并使用自己的专用测试平台在时钟频率高达50 GHz的情况下进行测试。使用麻省理工学院林肯实验室的铸造厂,以10和20 ka /cm2的电流密度生产,这种7比3的求和电路已成为数字电路的基准。最近,一个具有15个并行输入产生4位输出的版本使用两种8对4求和电路设计。第一个(8-to-4a)基于7-to-3并行计数器,对8个未加权输入求和,而第二个(8-to-4b)通过对两个8-to-4a块中权重相等的位进行成对求和,对两个4位二进制加权单词求和。我们将在讨论电路性能和良率的同时,讨论该电路的设计考虑因素。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
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