Efficient Design of QCA Adder Structures

Article Preview

Abstract:

Optimizing arithmetic primitives such as quantum-dot cellular automata (QCA) adders is important for investigating high-performance QCA computers in this emerging nano-technological paradigm. In this paper, we demonstrate that QCA ripple carry adder and bit-serial adder designs actually outperform carry-look-ahead and carry-select adder designs because of the increase in required interconnects. Simulation results obtained by using the QCADesigner tool for the proposed adder designs are also presented.

You might also be interested in these eBooks

Info:

Periodical:

Solid State Phenomena (Volumes 121-123)

Pages:

553-556

Citation:

Online since:

March 2007

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2007 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] C. S. Lent et al., Quantum cellular automata, Nanotechnology, vol. 4 pp.49-57, (1993).

Google Scholar

[2] K. Walus, T. J. Dysart, G. A. Jullien and R. A. Budiman, QCADesigner: A rapid design and Simulation tool for quantum-dot cellular automata, IEEE Transactions on Nanotechnology, vol. 3, no. 1, pp.26-31, (2004).

DOI: 10.1109/tnano.2003.820815

Google Scholar

[3] R. Zhang, K. Walnut, Wei Wang and G. Jullien, A method of majority logic reduction for quantum cellular automata, IEEE Trans. Nanotechnology, vol. 3, no. 4, pp.443-450, Dec. (2004).

DOI: 10.1109/tnano.2004.834177

Google Scholar