考虑长度匹配的快速单通量量子电路布线算法  

Rapid Single-Flux-Quantum Circuit Routing Algorithm Considering Length Matching

作　　者：刘耿耿[1,2] 余延涛 周茹平 魏榕山[3] 徐宁[4] Liu Genggeng;Yu Yantao;Zhou Ruping;Wei Rongshan;Xu Ning(College of Computer and Data Science,Fuzhou University,Fuzhou 350116;Fujian Key Laboratory of Network Computing and Intelligent Information Processing(Fuzhou University),Fuzhou 350116;College of Physics and Information Engineering,Fuzhou University,Fuzhou 350108;School of Information Engineering,Wuhan University of Technology,Wuhan 430070)

机构地区：[1]福州大学计算机与大数据学院,福州350116 [2]福建省网络计算与智能信息处理重点实验室(福州大学),福州350116 [3]福州大学物理与信息工程学院,福州350108 [4]武汉理工大学信息工程学院,武汉430070

出　　处：《计算机研究与发展》2025年第5期1151-1163,共13页Journal of Computer Research and Development

基　　金：国家自然科学基金项目(62372109);福建省杰出青年科学基金项目(2023J06017)。

摘　　要：由于快速单通量量子(rapid single-flux-quantum,RSFQ)电路的高频特性,对电路的版图设计构成了巨大挑战.针对RSFQ电路的高频特性带来的电路时延问题,可以在布线阶段通过使用延时元件如无源传输线来解决.因为无源传输线的时延与它的长度近似成正比,且传输线的功耗不随着线长增加而增大,所以对于快速单通量量子电路而言长度匹配布线是一个非常重要的问题.为此,提出了一种高效的考虑长度匹配的RSFQ电路布线算法,包括3个关键策略:1)在生成初始路径时,提出了一种迂回布线的方法,在不改变初始布线空间的情况下,满足无源传输线的部分长度匹配;2)提出了一种基于区域感知的迭代资源插入策略,减少需要添加的额外资源区域;3)提出了一种考虑阻塞代价的长度匹配驱动布线策略,提高了对布线空间的资源利用.实验结果表明所提算法与现有的多端布线算法相比,布线所需的区域面积减少了8%,运行时间减少了36%,从而取得快速且高质量的布线结果.The high frequency characteristics of rapid single-flux-quantum(RSFQ)circuits poses a great challenge to circuit layout design.In order to solve the circuit delay problem caused by the high frequency characteristics of RSFQ,delay elements such as passive transmission line can be used in the routing stage.The delay of a passive transmission line is roughly proportional to its length,and the power consumption of the passive transmission line does not increase with the increase of the wirelength,so length matching routing is a crucial problem for RSFQ circuits.Therefore,we propose an efficient RSFQ circuit routing algorithm considering length matching,including the following key strategies:1)when generating the initial path,a method of detour routing is presented to meet the partial length matching of passive transmission lines without changing the initial routing space;2)an iterative resource insertion algorithm based on region-awareness is utilized to reduce the area of additional resources needed to be added;3)a length-matching driven routing algorithm considering blocking cost is designed,which improves the resource utilization of routing space.Experimental results show that,compared with existing multi-terminal routing algorithms,the proposed algorithm reduces the area required for routing by 8%and the running time by 36%,thus achieving fast and high-quality routing results.

关 键 词：快速单通量量子电路 物理设计 时序匹配 长度匹配 通道布线 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]