QCA channel routing with wire crossing minimization

Authors:
Brian Stephen Smith;Sung Kyu Lim
Affiliations:
Georgia Institute of Technology, Atlanta, GA;Georgia Institute of Technology, Atlanta, GA
Venue:
GLSVLSI '05 Proceedings of the 15th ACM Great Lakes symposium on VLSI
Year:
2005

Citing 8
Cited 2

Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Modeling QCA for area minimization in logic synthesis

Proceedings of the 13th ACM Great Lakes symposium on VLSI
A “Dogleg” channel router

DAC '76 Proceedings of the 13th Design Automation Conference
Wire routing by optimizing channel assignment within large apertures

DAC '71 Proceedings of the 8th Design Automation Workshop
Design and characterization of an and-or-inverter (AOI) gate for QCA implementation

Proceedings of the 14th ACM Great Lakes symposium on VLSI
Quantum-Dot Cellular Automata (QCA) circuit partitioning: problem modeling and solutions

Proceedings of the 41st annual Design Automation Conference
Automatic cell placement for quantum-dot cellular automata

Integration, the VLSI Journal - Special issue: ACM great lakes symposium on VLSI
QCADesigner: a rapid design and Simulation tool for quantum-dot cellular automata

IEEE Transactions on Nanotechnology

Crossing minimization in weighted bipartite graphs

Journal of Discrete Algorithms
Crossing minimization in weighted bipartite graphs

WEA'07 Proceedings of the 6th international conference on Experimental algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.