The Robust QCA Adder Designs Using Composable QCA Building Blocks
The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
Abstract
Quantum-dot cellular automata (QCA) is attracting a lot of attention due to its extremely small feature size and ultralow power consumption. Up to now, several adder designs using QCA technology have been proposed. However, it was found that not all of the designs function properly. This paper analyzes the reasons of the failures and proposes adders that exploit proper clocking schemes
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
Logical devices implemented using quantum cellular automata
Tougaw, P. D., & Lent, C. S. (1994) · Journal of Applied Physics · doi:10.1063/1.356375 · Cited by 1,276 · cited 2×
“Tougaw and Lent proposed a QCA-based 1-bit full adder (FA) design in [4].”
BackgroundRealization of a Functional Cell for Quantum-Dot Cellular Automata
Orlov, A. O., Amlani, I., Bernstein, G. H., Lent, C. S., & Snider, G. L. (1997) · Science · doi:10.1126/science.277.5328.928 · Cited by 640 · cited 1×
“A clock cycle in QCA logic can in turn be divided into four phases, namely: 1) switch; 2) hold; 3) release; and 4) relax [12].”
BackgroundPower gain and dissipation in quantum-dot cellular automata
Timler, J., & Lent, C. S. (2002) · Journal of Applied Physics · doi:10.1063/1.1421217 · Cited by 437
Clocking of molecular quantum-dot cellular automata
Hennessy, K., & Lent, C. S. (2001) · Journal of Vacuum Science & Technology B: Microelectronics and Nanometer Structures Processing, Measurement, and Phenomena · doi:10.1116/1.1394729 · Cited by 372 · cited 2×
“In this paper, we will systematically analyze the sneak noise paths in QCA-based designs and investigate design principles that will make the QCA designs work against the sneak noise paths.”
MethodDynamic behavior of quantum cellular automata
Tougaw, P. D., & Lent, C. S. (1996) · Journal of Applied Physics · doi:10.1063/1.363455 · Cited by 316 · cited 1×
“The nonlinearity and bistable saturation of the cell–cell response serve the same role as gain in a conventional digital circuit [11].”
BackgroundClocked molecular quantum-dot cellular automata
Lent, C. S., & Isaksen, B. (2003) · IEEE Transactions on Electron Devices · doi:10.1109/ted.2003.815857 · Cited by 307 · cited 1×
“In this paper, we will systematically analyze the sneak noise paths in QCA-based designs and investigate design principles that will make the QCA designs work against the sneak noise paths.”
MethodQuantum-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 · cited 2×
“We redesigned the 1-bit FA using the robust QCA design principles that we discussed, as shown in Fig.”
BackgroundMethodComputer 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 · cited 2×
“Walus et al. have presented a serial adder [ 15 ].”
BackgroundA design of and design tools for a novel quantum dot based microprocessor
Niemier, M. T., Kontz, M. J., & Kogge, P. M. (2000) · ACM/IEEE Design Automation Conference (DAC) · doi:10.1145/337292.337398 · Cited by 75 · cited 1×
“A QCA-based ripple-carry adder can be designed by connecting the carry out of an FA to the carry in of the next FA [7]. A 1-bit ALU was proposed in [ 8 ].”
BackgroundExploring and exploiting wire-level pipelining in emerging technologies
Niemier, M. T., & Kogge, P. M. (2001) · Proceedings - International Symposium on Computer Architecture/Proceedings · doi:10.1145/379240.379261 · Cited by 70
High level exploration of quantum-dot cellular automata (QCA)
Walus, K., Schulhof, G., & JULLIEN, G. A. (2005) · Asilomar Conference on Signals, Systems and Computers (ACSSC) · doi:10.1109/acssc.2004.1399080 · Cited by 69 · cited 2×
“In fact, due to the same reason, the latest version of QCADesigner [ 16 ] completely abandons coplanar crossover and switches to multilayer crossover.”
BackgroundMethod
Cited by
Modular Design of testable reversible ALU by QCA multiplexer with increase in programmability
Sen, B., Dutta, M., Goswami, M., & Sikdar, B. K. (2014) · Microelectronics Journal · doi:10.1016/j.mejo.2014.08.012 · Cited by 167
“Multiplexer based circuits [11] such as data transmission logic, FPGA, memory circuits are available in the literature citing its immense applicability in the field of digital electronics.”
BackgroundAutomated 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
- Kim, K., Wu, K., & Karri, R.
- Venue
- IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Published
- 2007-01
- Volume
- 26
- Issue
- 1
- Pages
- 176-183
- ISSN
- 0278-0070 (ISSN-L)
- OpenAlex
- W2171993146
- Cited by
- 225
- References
- 12
- FWCI
- 9.13
- 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.