ACM Home Page
Please provide us with feedback. Feedback
Partitioning and placement for buildable QCA circuits
Full text PdfPdf (408 KB)
Source with EDA Technofair Design Automation Conference Asia and South Pacific archive
Proceedings of the 2005 conference on Asia South Pacific design automation table of contents
Shanghai, China
SESSION: Floorplanning and partitioning table of contents
Pages: 424 - 427  
Year of Publication: 2005
ISBN:0-7803-8737-6
Authors
Ramprasad Ravichandran  Georgia Institute of Technology
Mike Niemier  Georgia Institute of Technology
Sung Kyu Lim  Georgia Institute of Technology
Sponsors
SIGDA: ACM Special Interest Group on Design Automation
: Shanghai IC Industry Association
: IEEE SSCS Shanghai Chapter
: IEEE CAS
: IEEE Beijing Section
: Fudan University
: Chinese Institute of Electronics
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 3,   Downloads (12 Months): 24,   Citation Count: 0
Additional Information:

abstract   references   collaborative colleagues  

Tools and Actions: Review this Article  
Save this Article to a Binder    Display Formats: BibTex  EndNote ACM Ref   
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1120725.1120902
What is a DOI?

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. In this paper, we present partitioning and placement algorithms for a large-scale automatic QCA layout. The purpose of zone partitioning is to initially partition a given circuit such that a single clock potential modulates the interdot barriers in all of the QCA cells within each zone. We then place these zones during our placement step. We identify several objectives and constraints that will enhance the buildability of QCA circuits and use them in our optimization process. The results are intended to define what is computationally interesting and could actually be built within a set of predefined constraints.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
C. Lent, B. Isaksen, and M. Lieberman, "Molecular quantum-dot cellular automata," J. Am. Chem. Soc., pp. 1056--1063, 2003.
 
2
M. Lieberman, S. Chellamma, B. Varughese, Y. Wang, C. Lent, G. Bernstein, G. Snider, and F. Peiris, "Quantum-dot cellular automata at a molecular scale," Annals of the New York Academy of Science, pp. 225--239, 2002.
3
4
 
5
K. Sugiyama, S. Tagawa, and M. Toda, "Methods for visual understanding of hierarchical system structures," IEEE Trans. Syst. Man,. Cybern, pp. 109--125, 1981.
Collaborative Colleagues:
Ramprasad Ravichandran: colleagues
Mike Niemier: colleagues
Sung Kyu Lim: colleagues