CoChat

Automated Design Architecture for 1-D Cellular Automata Using Quantum Cellular Automata

The DOI matches its Crossref record; 81 of the 86 references it cites were found in a registry or an index.

Abstract

Cellular automata (CAs) have been widely used to model and simulate physical systems and processes. CAs have also been successfully used as a VLSI architecture that proved to be very efficient at least in terms of silicon-area utilization and clock-speed maximization. Quantum cellular automata (QCAs) as one of the promising emerging technologies for nanoscale and quantum computing circuit implementation, provides very high scale integration, very high switching frequency and extremely low power characteristics. In this paper we present a new automated design architecture and a tool, namely DATICAQ (Design Automation Tool of 1-D CAs using QCAs), that builds a bridge between 1-D CAs as models of physical systems and processes and 1-D QCAs as nanoelectronic architecture. The QCA implementation of CAs not only drives the already developed CAs circuits to the nanoelectronics era but improves their performance significantly. The inputs of the proposed architecture are CA dimensionality, size, local rule, and initial and boundary conditions imposed by the particular problem. DATICAQ produces as output the layout of the QCA implementation of the particular 1-D CA model. Simulations of CA models for zero and periodic boundary conditions and the corresponding QCA circuits showed that the CA models have been successfully implemented.

Overview

Integrity signals

Registry

Crossref · 10.1109/tc.2014.2366745

Cites

81 of 81 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Citations

Cites

Research works printed but not linked: 5

  1. wolfram, 2002, A New Kind of Science
  2. 10.1109/DAC.2000.855308 · doi:10.1109/dac.2000.855308
  3. bubna, 0, Designing cellular automata structures using quantum-dot cellular automata, 14th Annu IEEE Int Conf High Performance Comput
  4. kim, 0, Towards designing robust QCA architectures in the presence of sneak noise paths, Proc Des Autom Test Eur, 1214
  5. mardiris, 0, Design and simulation of modular 2n to 1 quantum-dot cellular automata (QCA) multiplexers, Int J Circ Theor Appl

Cited by

See all 17

Metadata

Authors
Mardiris, V. A., Sirakoulis, G. C., & Karafyllidis, I. G.
Affiliations
  • Technological Educational Institute of Eastern Macedonia and Thrace (GR)
  • Democritus University of Thrace (GR)
Venue
IEEE Transactions on Computers
Published
2015-09-01
Volume
64
Issue
9
Pages
2476-2489
ISSN
0018-9340 (ISSN-L)
OpenAlex
W1986622474
Cited by
17
References
86
Citations by year
2025: 1 · 2024: 1 · 2023: 1 · 2022: 3 · 2021: 1 · 2020: 2 · 2019: 2 · 2018: 5 · 2016: 1
FWCI
0.34
Type
journal article
Language
en
Open access
closed
Locations
IEEE Transactions on Computers (publishedVersion)
Topics
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › Cellular Automata and Applications
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › Quantum-Dot Cellular Automata
  • Physical Sciences › Mathematics › Theoretical Computer Science › DNA and Biological Computing
Keywords
quantum cellular automata, VLSI architecture, local rules, periodic boundary conditions, zero boundary conditions, low-power circuits

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.