一种针对QCA电路的门级布局布线算法设计  

A gate-level placement and routing algorithm design for QCA circuits

作　　者：邝锐 彭斐[1] 张永强[1] 解光军[1] KUANG Rui;PENG Fei;ZHANG Yongqiang;XIE Guangjun(School of Electronic Science and Applied Physics,Hefei University of Technology,Hefei 230009,China)

机构地区：[1]合肥工业大学电子科学与应用物理学院,安徽合肥230009

出　　处：《微电子学与计算机》2021年第9期79-83,共5页Microelectronics & Computer

基　　金：中央高校基本科研业务费专项资金(JZ2020HGQA0162;JZ2020HGTA0085)。

摘　　要：量子点元胞自动机(QCA)被认为是克服传统CMOS局限性的一种极有前景的解决方案.近年来,QCA电路的自动化设计工具的开发越来越受到研究者的关注,布局和布线算法则是其中至关重要的一环.算法设计的关键问题是时钟方案和时钟同步性约束.本文提出了一种门级布局和布线算法,在时钟方案约束的布局区域内预先计算和缓存路径信息,并应用深度优先搜索策略搜索正确的电路布局布线结果.该算法采用C++编程语言实现,仿真结果验证了算法的正确性.Quantum-Dot Cellular Automata(QCA) is considered asa promising solution to overcome the limitations ofconventional CMOS. Recently, the development of automated design tools for QCA circuits has attracted more and more attention from researchers, where the placement and routing algorithm is a critical step. The key issue of an algorithm design is the constraints of a clock scheme and clock synchronization. Agate-level placement and routing algorithm is proposed. The path information is pre-calculated and cached within the layout region constrained by the clock scheme, and the depth-first search strategy is applied to search for the correct circuit placement routing results. The algorithm is implemented in C++ programming language, and simulation results verify the correctness of the proposed algorithm.

关 键 词：量子元胞自动机 布局布线算法 深度优先搜索 

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