Partitioning and Placement for Buildable QCA Circuits

ACM Journal on Emerging Technologies in Computing Systems

Volumn 1, Issue 1, 2005, Pages 50-72

  Lim, Sung Kyu ^a   Ravichandran, Ramprasad ^b   Niemier, Mike ^b  

^a GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

^b Georgia Institute of Technology   (United States)

Author keywords

Algorithms; Design; Nanotechnology; partitioning; placement; quantum dot cellular automata

Indexed keywords

EID: 33750483353     PISSN: 15504832     EISSN: 15504840     Source Type: Journal    
DOI: 10.1145/1063803.1063806     Document Type: Article

References (33)

1. Amlani, I., Orlov, A., Snider, G., and Lent, C. 1998. Demonstation of a func. quantum-dot cellular automata cell. J.Vac. Sci. Tech. 3795-3799.
2. Amlani, I., Orlov, A., Toth, G., Bernstein, G., Lent, C., and Snider, G. 1999. Digital logic gate using quantum-dot cellular automata. Science. 289-291.
3. Antonelli, D., Chen, D., Dysart, T., Hu, X., Kahng, A., Kogge, P., Murphy, R., and Niemier, M. 2004. Quantum-dot cellular automata partitioning: Problem modeling and solutions. In Proceedings of the ACM Design Automation Conference.
4. Bernstein, G. 2003. Quantum-dot cellular automata: Computing by polarized systems. In Proceedings of the ACM Design Automation Conference.
5. Cong, J. and Lim, S. K. 2000. Performance driven multiway partitioning. In Proceedings of the Asia and South Pacific Design Automation Conference. 441-446.
6. Dunlop, A. and Kernighan, B. 1985. A procedure for placement of standard-cell VLSI circuits. IEEE Trans. Comput.-Aid. Des. Integr. Circuits Syst. 92-98.
7. Enos, M., Hauck, S., and Sarrafzadeh, M. 1999. Evaluation and optimization of replication algorithms for logic bipartitioning. IEEE Trans. Comput.-Aid. Des. Integr. Circuits Syst. 1237-1248.
8. Garey, M. R. and Johnson, D. S. 1979. Computers and Intractability: A Guide To the Theory of NP-Completeness. Freeman, San Francisco, 209-210.
9. Gergel, N., Craft, S., and Lach, J. 2003. Modeling QCA for area minimization in logic synthesis. In Proceedings of the Great Lakes Symposum on VLSI. 60-63.
10. Hamilton, S. 1999. Taking moore's law into the next century. IEEE Comput. 43-48.
11. Hennessy, K. and Lent, C. 2001. Clocking of molecular quantum-dot cellular automata. J. Vacuum Science Tech. 1752-1755.
12. Ho, R., Mai, K., and Horowitz, M. 2001. The future of wires. Proceedings of the IEEE. 490-504.
13. Huang, J., Momenzadeh, M., Tahoori, M. B., and Lombardi, F. 2004. Design and characterization of an and-or-inverter (AOI) gate for QCA implementation. In Proceedings of the Great Lakes Symposum on VLSI.
14. Kleinhans, J. M., Sigl, G. Johannes, F. M., and Antreich, K. J. 1991. GORDIAN: VLSI placement by quadratic programming and slicing optimization. IEEE Trans. on Comput-Aided Des. Integr. Circuits Syst. 10, 3, 356-365.
15. Kummamuru, R., Timler, J., Toth, G., Lent, C., Ramasubramaniam, R., Orlov, A., and Bernstein, G. 2002. Power gain in a quantum-dot cellular automata latch. Applied Physics Letters. 1332-1334.
16. Leni, C. S. 2002. Molecular electronics: Bypassing the transistor paradigm. Science, 1597-1599.
17. Lieberman, M., Chellamma, S., Varughese, B., Wang, Y., Lent, C., Bernstein, G., Snider, G., and Peiris, F. 2002. Quantum-dot cellular automata at a molecular scale. Annals of the New York Academy of Science. 225-239.
18. Mead, C. and Conway, L. 1980. Introduction to VLSI Systems. Addison-Wesley Publishing Co.
19. Murata, H., Fujiyoshi, K., Nakatake, S., and Kajitani, Y. 1995. Rectangle packing based module placement. in Proceedings of the IEEE International Conference on Computer-Aided Design. 472-479.
20. Nguyen, J., Ravichandran, R., Lim, S. K., and Niemier, M. 2003. Global placement for quantum- dot cellular automata based circuits. Tech. Rep. GIT-CERCS-03-20, Georgia Institute of Technology.
21. Niemier, M. 2003. The effects of a new technology on the design, organization, and architectures of computing systems. Ph.D. Dissertation, Univ. of Notre Dame.
22. Niemier, M. and Kogge, P. 2001. Exploring and exploiting wire-level pipelining in emerging technologies. in Proceedings of the Great Lakes Symposum on VLSI.
23. Niemier, M. and Kogge, P. 2004. The 4-diamond circuit: A minimally complex nano-scale computational building block in QCA. In IEEE Symposium on VLSI. 3-10.
24. Packan, P. 1999. Pushing the limits. Science, 2079-2081.
25. Rabaey, J. M. 1996. Digital Integrated Circuits: A Design Perspective. Prentice Hall Electronics.
26. Ravichandran, R., Ladiwala, N., Nguyen, J., Niemier, M., and Lim, S. K. 2004. Automatic cell placement for quantum-dot cellular automata. in Proceedings of the Great Lakes Symposum on VLSI. 634-639.
27. Rutten, P. 2001. Is moore's law infinite? The economics of Moore's law. Kellog Tech Venture. 1-28.
28. Snider, G., Orlov, A., Amlani, I., Bernstein, G., Lent, C., Merz, J., and Porod, W. 1999. Quantum- dot cellular automata: Line and majority gate logic. Jpn. J. Appl. Phys., 7227-7229.
29. Sugiyama, K., Tagawa, S., and Toda, M. 1981. Methods for visual understanding of hierarchical system structures. IEEE Trans. Syst. Man., Cybern. 109-125.
30. Sun, W. J. and Sechen, C. 1995. Efficient and effective placement for very large circuits. IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst. 14, 3, 349-359.
31. Tougaw, P. and Lent, C. 1994. Logical devices implemented using quantum cellular automata. J. Appl. Phys. 1818.
32. Tsay, R. S. 1993. An exact zero-skew clock routing algorithm. IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst.
33. Walus, K., Dysart, T., Jullien, G., and Budiman, R. 2004. QCADesigner: A rapid design and simulation tool for quantum-dot cellular automata. IEEE Trans. Nanotech.