Automatic cell placement for quantum-dot cellular automata
Proceedings of the 14th ACM Great Lakes symposium on VLSI
QCA channel routing with wire crossing minimization
GLSVLSI '05 Proceedings of the 15th ACM Great Lakes symposium on VLSI
Hi-index | 0.00 |
Quantum-dot cellular automata (QCA) is a novel nano-scale computing mechanism that can represent binary information based on spatial distribution of electron charge configuration in chemical molecules. In this paper we develop the first cell-level placement of QCA circuits under buildability constraints. We formulate the QCA cell placement as a unidirectional geometric embedding of k-layered bipartite graphs. We then present an analytical and a stochastic solution for minimizing the wire crossings and wire length in these placement solutions.