Quantum-Dot Cellular Automata (QCA) circuit partitioning: problem modeling and solutions

Authors:
Dominic A. Antonelli;Danny Z. Chen;Timothy J. Dysart;Xiaobo S. Hu;Andrew B. Kahng;Peter M. Kogge;Richard C. Murphy;Michael T. Niemier
Affiliations:
University of Notre Dame, Notre Dame, IN;University of Notre Dame, Notre Dame, IN;University of Notre Dame, Notre Dame, IN;University of Notre Dame, Notre Dame, IN;University of California, San Diego, La Jolla, CA;University of Notre Dame, Notre Dame, IN;University of Notre Dame, Notre Dame, IN;University of Notre Dame, Notre Dame, IN
Venue:
Proceedings of the 41st annual Design Automation Conference
Year:
2004

Citing 4
Cited 14

Recent directions in netlist partitioning: a survey

Integration, the VLSI Journal
Exploring and exploiting wire-level pipelining in emerging technologies

ISCA '01 Proceedings of the 28th annual international symposium on Computer architecture
Algorithms for VLSI Physical Design Automation

Algorithms for VLSI Physical Design Automation
Logic in Wire: Using Quantum Dots to Implement a Microprocessor

GLS '99 Proceedings of the Ninth Great Lakes Symposium on VLSI

QCA channel routing with wire crossing minimization

GLSVLSI '05 Proceedings of the 15th ACM Great Lakes symposium on VLSI
Partitioning and placement for buildable QCA circuits

ACM Journal on Emerging Technologies in Computing Systems (JETC)
Tile-based QCA design using majority-like logic primitives

ACM Journal on Emerging Technologies in Computing Systems (JETC)
Eliminating wire crossings for molecular quantum-dot cellular automata implementation

ICCAD '05 Proceedings of the 2005 IEEE/ACM International conference on Computer-aided design
Designing layout-timing independent quantum-dot cellular automata (QCA) circuits by global asynchrony

Journal of Systems Architecture: the EUROMICRO Journal
A model for computing and energy dissipation of molecular QCA devices and circuits

ACM Journal on Emerging Technologies in Computing Systems (JETC)
Scalability of Globally Asynchronous QCA (Quantum-Dot Cellular Automata) Adder Design

Journal of Electronic Testing: Theory and Applications
Reversible Gates and Testability of One Dimensional Arrays of Molecular QCA

Journal of Electronic Testing: Theory and Applications
A layout-aware physical design method for constructing feasible QCA circuits

Proceedings of the 18th ACM Great Lakes symposium on VLSI
Design and simulation of sequential circuits in quantum-dot cellular automata: Falling edge-triggered flip-flop and counter study

Microelectronics Journal
On approximating the maximum simple sharing problem

ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Layout design of manufacturable quantum-dot cellular automata

Microelectronics Journal
Approximating the maximum sharing problem

WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Multi-objective optimization of QCA circuits with multiple outputs using genetic programming

Genetic Programming and Evolvable Machines

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents the Quantum-Dot Cellular Automata (QCA) physical design problem, in the context of the VLSI physical design problem. The problem is divided into three subproblems: partitioning, placement, and routing of QCA circuits. This paper presents an ILP formulation and heuristic solution to the partitioning problem, and compares the two sets of results. Additionally, we compare a human-generated circuit to the ILP and Heuristic solutions. The results demonstrate that the heuristic is a practical method of reducing partitioning run time while providing a result that is close to the optimal for a given circuit.