Automatic cell placement for quantum-dot cellular automata

Authors:
Ramprasad Ravichandran;Nihal Ladiwala;Jean Nguyen;Mike Niemier;Sung Kyu Lim
Affiliations:
Georgia Institute of Technology, Atlanta, GA;Georgia Institute of Technology, Atlanta, GA;Georgia Institute of Technology, Atlanta, GA;Georgia Institute of Technology, Atlanta, GA;Georgia Institute of Technology, Atlanta, GA
Venue:
Proceedings of the 14th ACM Great Lakes symposium on VLSI
Year:
2004

Citing 2
Cited 7

Modeling QCA for area minimization in logic synthesis

Proceedings of the 13th ACM Great Lakes symposium on VLSI
Quantum-dot cellular automata: computing by field polarization

Proceedings of the 40th annual Design Automation Conference

Automatic cell placement for quantum-dot cellular automata

Integration, the VLSI Journal - Special issue: ACM great lakes symposium on VLSI
Partitioning and placement for buildable QCA circuits

ACM Journal on Emerging Technologies in Computing Systems (JETC)
Partitioning and placement for buildable QCA circuits

Proceedings of the 2005 Asia and South Pacific Design Automation Conference
Eliminating wire crossings for molecular quantum-dot cellular automata implementation

ICCAD '05 Proceedings of the 2005 IEEE/ACM International conference on Computer-aided design
Partitioning and placement for buildable QCA circuits

Nano, quantum and molecular computing
Applying inherent capabilities of quantum-dot cellular automata to design: D flip-flop case study

Journal of Systems Architecture: the EUROMICRO Journal
Automatic cell placement for quantum-dot cellular automata

Integration, the VLSI Journal - Special issue: ACM great lakes symposium on VLSI

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. It has the potential to allow for circuits and systems with functional densities that are better than end of the roadmap CMOS, but also imposes new constraints on system designers. In this paper we develop the first cell-level placement of QCA circuits, where the given circuit is assumed to be partitioned into 4-phase asynchronous QCA timing zones. We formulate the QCA cell placement in each timing zone 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.