ACM Home Page
Please provide us with feedback. Feedback
Quantum-Dot Cellular Automata (QCA) circuit partitioning: problem modeling and solutions
Full text PdfPdf (322 KB)
Source Annual ACM IEEE Design Automation Conference archive
Proceedings of the 41st annual Design Automation Conference table of contents
San Diego, CA, USA
SESSION: New ideas in placement table of contents
Pages: 363 - 368  
Year of Publication: 2004
ISBN:1-58113-828-8
Authors
Dominic A. Antonelli  University of Notre Dame, Notre Dame, IN
Danny Z. Chen  University of Notre Dame, Notre Dame, IN
Timothy J. Dysart  University of Notre Dame, Notre Dame, IN
Xiaobo S. Hu  University of Notre Dame, Notre Dame, IN
Andrew B. Kahng  University of California, San Diego, La Jolla, CA
Peter M. Kogge  University of Notre Dame, Notre Dame, IN
Richard C. Murphy  University of Notre Dame, Notre Dame, IN
Michael T. Niemier  University of Notre Dame, Notre Dame, IN
Sponsors
ACM: Association for Computing Machinery
SIGDA: ACM Special Interest Group on Design Automation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 18,   Downloads (12 Months): 67,   Citation Count: 9
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/996566.996671
What is a DOI?

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.


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
A. O. Orlov et al. Expiremental demonstration of clocked single electron switching in quantum-dot cellular automata. Appl. Phys. Lett., 77(2):295--297, July 2000.
 
2
 
3
I. Amlani et al. Digital logic gate using quantum-dot cellular automata.Science 284:289--291, April 1999.
 
4
Q. Hang, Y. Wang, M. Lieberman, and G. H. Bernstein. Molecular patterning through high-resolution polymethylmethacrylate masks. Appl. Phys. Lett., 80(22):4220--4222, June 2002.
 
5
K. Hennessy and C. S. Lent. Clocking of molecular quantum-dot cellular automata. Journal of Vacuum Science and Technology 19(5):1752--1755, September/October 2001.
 
6
X. S. Hu, S. C. Bass, and R. G. Harber. Minimizing the number of delay buffers in the synchronization of pipelined systems. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 13(12):1441--1449, December 1994.
 
7
J. Jiao, G. J. Long, F. Grandjean, A. M. Beatty, and T. P. Fehlner. Building blocks for the molecular expression of quantum cellular automata. isolation and characterization of a covalently bonded square array of two ferrocenium and two ferrocene complexes. J. Am. Chem. Soc., 125:7522--7523, 2003.
 
8
R. K. Kummamuru et al. Operation of a quantum-dot cellular automata (QCA) shift register and analysis of errors. IEEE Transactions on Electron Devices 50(9):1906--1913, September 2003.
 
9
C. Leiserson and J. Saxe. Retiming synchronous circuitry. Algorithmica 6(1):5--35, 1990.
 
10
C. S. Lent and B. Isaksen. Clocked molecular quantum-dot cellular automata. IEEE Transactions on Electron Devices 50(9).
 
11
C. S. Lent, B. Isaksen, and M. Lieberman. Molecular quantum-dot cellular automata. J. Am. Chem. Soc., 125(4):1056--1063,2003.
 
12
Craig S. Lent, P. Douglas Tougaw, and Wolfgang Porod. Quantum Cellular Automata. Nanotechnology 4, 49 1993.
 
13
Z. Li and T. P. Fehlner. Molecular QCA cells. 2. characterization of an unsymmetrical dinuclear mixed-valence complex bound to a au surface by an organic linker. Inorganic Chemistry 42:5715--5721, 2003.
 
14
M. Lieberman et al.Quantum-dot cellular automata at a molecular scale.Ann. N.Y. Acad. Sci., 960:225--239, 2002.
 
15
M. T. Niemier and P. M. Kogge. Logic-in-wire: Using quantum dots to implement a microprocessor. In International Conference on Electronics, Circuits, and Systems (ICECS '99), Cyprus, September 1999.
 
16
Michael T. Niemier. Designing Digital Systems in Quantum Cellular Automata MS CSE Thesis, University of Notre Dame, April 2000.
 
17
Michael T. Niemier and Peter M. Kogge. Problems in designing with QCAs: Layout = timing. International Journal of Circuit Theory and Applications 29:49--62, April 2001.
18
 
19
A. O. Orlov et al. Expiremental demonstration of a binary wire for quantum-dot cellular automata. Appl. Phys. Lett., 74(19):2875--2877, May 1999.
 
20
A.O. Orlov et al. Clocked quantum-dot cellular automata shift register. Surface Science 532--535:1193--1198, June 2003.
 
21
H. Qi et al.Molecular quantum cellular automata cells. electric field driven switching of a silicon surface bound array of vertically oriented two-dot molecular quantum cellular automata. J. Am. Chem. Soc., 125:15250--15259, 2003.
 
22

CITED BY  9

Collaborative Colleagues:
Dominic A. Antonelli: colleagues
Danny Z. Chen: colleagues
Timothy J. Dysart: colleagues
Xiaobo S. Hu: colleagues
Andrew B. Kahng: colleagues
Peter M. Kogge: colleagues
Richard C. Murphy: colleagues
Michael T. Niemier: colleagues