Research And Design Of Automatic Placement And Routing Algorithm For Quantum Cellular Automata Circuits

With the development and progress of science and manufacturing technology,the feature size of CMOS technology devices is getting smaller and approaching to the physical limitations.It introduces many problems,such as short-channel effects,interconnection delay,parasitic effects,and high energy consumption.These problems severely restrict the further development of integrated circuits.Therefore,researchers began to study new nanotechnology devices in order to replace traditional CMOS devices.Quantum Cell Automata(QCA)was proposed in the 1990 s.Due to its excellent performance such as extremely fast computing speed,high integration and low power consumption,it is considered a device with great potential.The automatic placement and routing of QCA circuits is a key step in automated design.There are still many shortcomings in theory and algorithm implementation,which limit the development of automated design tools.In order to overcome the current problems,firstly,this thesis analyzes the related concepts of QCA circuit layout and the key issues that must be considered when designing algorithms,such as clock constraints,clock synchronization constraints,and wire crossovers.Secondly,summarizes the overall process of algorithm design,and clarify the work completed by each process to guide the design of the algorithm.Thirdly,this thesis models the problem of QCA circuit placement and routing,and defines the input of the algorithm and the mathematical expression of the constraints.Then,this dissertation designs and realizes two different placement and routing algorithm schemes based on circuit classification and genetic algorithm respectively using C++ programming language.Circuit classification algorithm is the application of graph theory,genetic algorithm is a heuristic search strategy.This thesis analyzes in detail the basic principles,path calculation algorithm,node placement and routing,and result output of circuit classification and genetic algorithm placement and routing scheme.Both algorithms can realize the automatic placement and routing of QCA circuits,the clock scheme can be choosen by user,then,outputs the gate level layout that meets the relevant constraints.Finally,comparing and analyzing the advantages and disadvantages of the two algorithms.