QCA channel routing with wire crossing minimization

Quantum-dot Cellular Automata (QCA) is a novel computing mechanism that can represent binary information based on spatial distribution of electron charge configuration in chemical molecules. QCA layout is currently restricted to a single layer with very limited number of wire crossing permitted. Thus, wire crossing minimization is crucial in improving the manufacturability of QCA circuits. In this article, we present the first QCA channel routing algorithm for wire crossing minimization. Our channel routing algorithm is able to reduce crossings, where Left-Edge First, Yoshimura and Kuh, and topologically-based algorithms fail to do so. Categories and Subject Descriptors B.7.2 [Design Aid]: Placement and routing General Terms Algorithms, Design, Theory Keywords QCA channel routing, wire crossing minimization, weighted minimum feedback edge set

• Type: Conference
• Year: 2005
• Where: GLVLSI
• Authors: Brian Stephen Smith, Sung Kyu Lim
• Keywords: Channel Routing Algorithm, GLVLSI 2005, QCA Channel, VLSI, Wire Crossing Minimization