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

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 the results of a human-generated circuit to the ILP and Heuristic formulations. 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.

• Type: Conference
• Year: 2004
• Where: DAC
• Authors: Dominic A. Antonelli, Danny Z. Chen, Timothy J. Dysart, Xiaobo Sharon Hu, Andrew B. Kahng, Peter M. Kogge, Richard C. Murphy, Michael T. Niemier
• Keywords: DAC 2004, Design Automation, Heuristic Formulations, Partitioning Problem, Physical Design Problem