General floorplan for reversible quantum-dot cellular automata

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback
Take a look at the new version of this page: [ beta version ]. Tell us what you think.

General floorplan for reversible quantum-dot cellular automata

Full text

Pdf (6.16 MB)

Source

Conference On Computing Frontiers archive
Proceedings of the 4th international conference on Computing frontiers table of contents

Ischia, Italy

SESSION: Quantum computing table of contents

Pages: 77 - 82

Year of Publication: 2007

ISBN:978-1-59593-683-7

Authors

Sarah E. Frost-Murphy	University of Notre Dame, Notre Dame, IN and Sandia National Laboratories
Erik P. DeBenedictis	Sandia National Laboratories, Albuquerque, NM
Peter M. Kogge	University of Notre Dame, Notre Dame, IN

Sponsors

ACM: Association for Computing Machinery
SIGMICRO: ACM Special Interest Group on Microarchitectural Research and Processing

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 3, Downloads (12 Months): 29, Citation Count: 0

Additional Information:

abstract references index terms collaborative colleagues

Tools and Actions:	Request Permissions 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/1242531.1242545 What is a DOI?

ABSTRACT

This paper presents the Collapsed Bennett Layout, a general purpose floorplan for reversible quantum-dot cellular automata (QCA) circuits. In order to exploit the full density and speed potential of emerging nanodevices, the principles of reversible computing need to be incorporated into the design of nanoscale circuits and systems. The Collapsed Bennett Layout implements Bennett's algorithm in hardware, allowing any arbitrary logic function to be implemented reversibly in QCA.

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. Bennett. Logical reversibility of computation. IBM J. Res. Develop., pages 525--532, November 1973.
	2	Charles H. Bennett, Time/space trade-offs for reversible computation, SIAM Journal on Computing, v.18 n.4, p.766-776, Aug. 1989 [doi>10.1137/0218053]
	3	S. Frost. Memory architecture for quantum-dot cellular automata. Master's thesis, University of Notre Dame, March 2005.
	4	S. E. Frost, A. F. Rodrigues, A. W. Janiszewski, R. T. Rausch, and P. M. Kogge. Memory in motion: A study of storage structures in qca. In 1st Workshop on Non-Silicon Computation (NSC-1), held in conjunction with 8th Int. Symp. on High Performance Computer Architecture (HPCA-8), Boston, MS, Feb 3 2002.
	5	S. Frost-Murphy, M. Ottavi, M. Frank, and E. DeBenedictis. On the design of reversible qdca systems. Technical Report SAND2006-5990, Sandia National Laboratories, 2006.
	6	R. Landauer. Irreversibility and heat generation in the computing process. IBM Journal, pages 183--191, July 1961.
	7	M. Niemier. Designing digital systems in quantum cellular automata. Master's thesis, University of Notre Dame, April 2000.
	8	Michael Thaddeus Niemier , Peter M. Kogge, The effects of a new technology on the design, organization, and architectures of computing systems, University of Notre Dame, Notre Dame, IN, 2003
	9	Tommaso Toffoli, Cellular automata mechanics., University of Michigan, Ann Arbor, MI, 1977
	10	T. Toffoli. Reversible computing. Technical Report MIT/LCS/TM-151, MIT, 1980.