Global Placement for Quantum-dot Cellular Automata Based Circuits

Quantum Cellular Automata (QCA) has been proposed as an alternative architecture to CMOS and in principle should permit the implementation of ultra lower-power, nano-scale logic circuitry working at teraflop frequency. QCA is based on a new paradigm for encoding binary logic into electronic circuitry, where binary 1s and 0s are mapped to spatial configurations of electrons rather than magnitudes of electronic currents. The layout rules for QCA based circuits are radically different from those of CMOS based circuits, and design automation tools for QCA circuit layout are hard to find. This paper discusses the first automatic global placement algorithm for QCA-based circuits. We divide the QCA global placement process into zone partitioning and zone placement, and identify the constraints and objectives that are unique to QCA-based circuits as opposed to the conventional CMOS VLSI.

[1]  Peter Eades,et al.  Edge crossings in drawings of bipartite graphs , 1994, Algorithmica.

[2]  C. Lent,et al.  Quantum‐Dot Cellular Automata at a Molecular Scale , 2002 .

[3]  Carl Sechen,et al.  Efficient and effective placement for very large circuits , 1993, ICCAD.

[4]  Craig S. Lent,et al.  Bypassing the Transistor Paradigm , 2000, Science.

[5]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[6]  C. Lent,et al.  Clocking of molecular quantum-dot cellular automata , 2001 .

[7]  Tiziana Catarci,et al.  The assignment heuristic for crossing reduction , 1995, IEEE Trans. Syst. Man Cybern..

[8]  R. M. Mattheyses,et al.  A Linear-Time Heuristic for Improving Network Partitions , 1982, 19th Design Automation Conference.

[9]  Stefan Dresbach.  A New Heuristic Layout Algorithm for DAGs , 1995 .

[10]  A. Aviram.  Molecules for memory, logic and amplification , 1988 .

[11]  Mitsuhiko Toda,et al.  Methods for Visual Understanding of Hierarchical System Structures , 1981, IEEE Transactions on Systems, Man, and Cybernetics.

[12]  Marie-Jose Carpano,et al.  Automatic Display of Hierarchized Graphs for Computer-Aided Decision Analysis , 1980, IEEE Transactions on Systems, Man, and Cybernetics.

[13]  Syed A. Rizvi.  Analyzing the tolerance and controls on critical dimensions and overlays as prescribed by the National Technology Roadmap for Semiconductors , 1997, Other Conferences.

[14]  P. D. Tougaw,et al.  A device architecture for computing with quantum dots , 1997, Proc. IEEE.

[15]  Carl Sechen,et al.  IMPROVED SIMULATED ANNEALING ALGORIHM FOR ROW-BASED PLACEMENT. , 1987 .

[16]  W. Porod,et al.  Quantum-dot cellular automata , 1999 .

[17]  Emile H. L. Aarts,et al.  Simulated Annealing: Theory and Applications , 1987, Mathematics and Its Applications.

[18]  N. Metropolis,et al.  Equation of State Calculations by Fast Computing Machines , 1953, Resonance.

[19]  D N Davy.  The molecules of memory. , 2000, Biologist.

[20]  Carl Sechen,et al.  VLSI Placement and Global Routing Using Simulated Annealing , 1988 .

[21]  Michael Jünger,et al.  Journal of Graph Algorithms and Applications 2-layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms , 2022 .

[22]  C. Sechen,et al.  New algorithms for the placement and routing of macro cells , 1990, 1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.

[23]  P. D. Tougaw,et al.  Logical devices implemented using quantum cellular automata , 1994 .