The DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
Adder and Multiplier Design in Quantum-Dot Cellular Automata
Abstract
Quantum-dot cellular automata (QCA) is an emerging nanotechnology, with the potential for faster speed, smaller size, and lower power consumption than transistor-based technology. Quantum-dot cellular automata has a simple cell as the basic element. The cell is used as a building block to construct gates and wires. Previously, adder designs based on conventional designs were examined for implementation with QCA technology. That work demonstrated that the design trade-offs are very different in QCA. This paper utilizes the unique QCA characteristics to design a carry flow adder that is fast and efficient. Simulations indicate very attractive performance (i.e., complexity, area, and delay). This paper also explores the design of serial parallel multipliers. A serial parallel multiplier is designed and simulated with several different operand sizes.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Lent, C. S., Tougaw, P. D., Porod, W., & Bernstein, G. H. (1993) · Nanotechnology · doi:10.1088/0957-4484/4/1/004 · Cited by 1,793
QCADesigner: A Rapid Design and Simulation Tool for Quantum-Dot Cellular Automata
Walus, K., Dysart, T. J., Jullien, G. A., & Budiman, R. A. (2004) · IEEE Transactions On Nanotechnology · doi:10.1109/tnano.2003.820815 · Cited by 1,106
Room Temperature Magnetic Quantum Cellular Automata
Cowburn, R. P., & Welland, M. E. (2000) · Science · doi:10.1126/science.287.5457.1466 · Cited by 1,011
Adder Designs and Analyses for Quantum-Dot Cellular Automata
Cho, H., & Swartzlander, E. E. (2007) · IEEE Transactions On Nanotechnology · doi:10.1109/tnano.2007.894839 · Cited by 313
Self-citationQuantum-dot cellular automata adders
Wang, W., Walus, K., & Jullien, G. A. (2004) · 2003 Third IEEE Conference on Nanotechnology, 2003. IEEE-NANO 2003. · doi:10.1109/nano.2003.1231818 · Cited by 248
Bennett clocking of quantum-dot cellular automata and the limits to binary logic scaling
Lent, C. S., Liu, M., & Lu, Y. (2006) · Nanotechnology · doi:10.1088/0957-4484/17/16/040 · Cited by 224
Design Tools for an Emerging SoC Technology: Quantum-Dot Cellular Automata
Walus, K., & Jullien, G. A. (2006) · Proceedings of the IEEE · doi:10.1109/jproc.2006.875791 · Cited by 217
Qi, H., Sharma, S., Li, Z., Snider, G. L., Orlov, A. O., Lent, C. S., & Fehlner, T. P. (2003) · Journal of the American Chemical Society · doi:10.1021/ja0371909 · Cited by 207
Nanowire-based sublithographic programmable logic arrays
DeHon, A., & Wilson, M. J. (2004) · Proceedings of the 2004 ACM/SIGDA 12th international symposium on Field programmable gate arrays · doi:10.1145/968280.968299 · Cited by 192
Experimental demonstration of a binary wire for quantum-dot cellular automata
Orlov, A. O., Amlani, I., Toth, G., Lent, C. S., Bernstein, G. H., & Snider, G. L. (1999) · Applied Physics Letters · doi:10.1063/1.124043 · Cited by 181
Experimental demonstration of a leadless quantum-dot cellular automata cell
Amlani, I., Orlov, A. O., Kummamuru, R. K., Bernstein, G. H., Lent, C. S., & Snider, G. L. (2000) · Applied Physics Letters · doi:10.1063/1.127103 · Cited by 146
Operation of a quantum-dot cellular automata (QCA) shift register and analysis of errors
Kummamuru, R. K., Orlov, A. O., Ramasubramaniam, R., Lent, C. S., Bernstein, G. H., & Snider, G. L. (2003) · IEEE Transactions on Electron Devices · doi:10.1109/ted.2003.816522 · Cited by 146
Computer arithmetic structures for quantum cellular automata
Walus, K., JULLIEN, G. A., & Dimitrov, V. S. (2004) · Asilomar Conference on Signals, Systems and Computers (ACSSC) · doi:10.1109/acssc.2003.1292223 · Cited by 129
Snider, G. L., Orlov, A. O., Amlani, I., Zuo, X., Bernstein, G. H., Lent, C. S., Merz, J. L., & Porod, W. (1999) · Journal of Vacuum Science & Technology A Vacuum Surfaces and Films · doi:10.1116/1.581826 · Cited by 87
Inversion schemes for sublithographic programmable logic arrays
Gojman, B., Manem, H., Rose, G. S., & DeHon, A. M. (2009) · IET Computers & Digital Techniques · doi:10.1049/iet-cdt.2008.0128 · Cited by 49
Serial Parallel Multiplier Design in Quantum-dot Cellular Automata
Cho, H., & Swartzlander, E. E. (2007) · IEEE Symposium on Computer Arithmetic (ARITH) · doi:10.1109/arith.2007.32 · Cited by 40
Self-citationA model for computing and energy dissipation of molecular QCA devices and circuits
Ma, X., Huang, J., & Lombardi, F. (2008) · ACM Journal on Emerging Technologies in Computing Systems · doi:10.1145/1324177.1324180 · Cited by 28
Modular Design of Conditional Sum Adders Using Quantum-dot Cellular Automata
Cho, H., & Swartzlander, E. E. (2006) · IEEE Conference on Nanotechnology (IEEE NANO) · doi:10.1109/nano.2006.247652 · Cited by 24
Self-citationPipelined Carry Lookahead Adder Design in Quantum-dot Cellular Automata
Cho, H., & Swartzlander, E. E. (2006) · Asilomar Conference on Signals, Systems and Computers (ACSSC) · doi:10.1109/acssc.2005.1599949 · Cited by 19
Self-citationQuantum-dot cellular automata SPICE macro model
Tang, R., Zhang, F., & Kim, Y.-B. (2005) · ACM Great Lakes Symposium on VLSI (GLSVLSI) · doi:10.1145/1057661.1057688 · Cited by 14
Cited by
Consequences of Many-Cell Correlations in Clocked Quantum-Dot Cellular Automata
Taucer, M., Karim, F., Walus, K., & Wolkow, R. A. (2015) · IEEE Transactions on Nanotechnology · doi:10.1109/tnano.2015.2426058 · Cited by 29
Automated Design Architecture for 1-D Cellular Automata Using Quantum Cellular Automata
Mardiris, V. A., Sirakoulis, G. C., & Karafyllidis, I. G. (2015) · IEEE Transactions on Computers · doi:10.1109/tc.2014.2366745 · Cited by 17
Metadata
- Authors
- Cho, H., & Swartzlander, E. E.
- Venue
- IEEE Transactions on Computers
- Published
- 2009-06
- Volume
- 58
- Issue
- 6
- Pages
- 721-727
- ISSN
- 0018-9340 (ISSN-L)
- OpenAlex
- W2128369966
- Cited by
- 353
- References
- 20
- FWCI
- 14.49
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.