z-logo
Premium
Design and Simulation of Innovative QCA Quaternary Logic Gates
Author(s) -
AkbariHasanjani Reza,
SabbaghiNadooshan Reza
Publication year - 2021
Publication title -
advanced theory and simulations
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.068
H-Index - 17
ISSN - 2513-0390
DOI - 10.1002/adts.202100069
Subject(s) - quantum dot cellular automaton , logic gate , cellular automaton , computer science , or gate , quantum gate , ternary operation , and gate , logic synthesis , binary number , quantum cellular automaton , electronic engineering , topology (electrical circuits) , quantum , quantum computer , algorithm , mathematics , arithmetic , engineering , physics , electrical engineering , quantum mechanics , programming language
This paper proposes a new cell configuration for quaternary Quantum Cellular Automata (QQCA) based on the calculation of polarization. The proposed QQCA cell is based on a three‐particle system that creates instability within a cell in the gate design. Therefore, a single‐particle system or binary QCA (bQCA) technology and a two‐particle system or Ternary QCA (TQCA) technology have been used to implement quaternary logic. The proposed cell can be implemented in two layers or in one, using input and output drives. According to the dimensions of the proposed model for QQCA and simulation of basic gates, designing with this cell is quite optimal; it requires five cells in the design of the AND and OR gates and two cells in the design of the NOT gate. Based on the number of cells used in the basic gates, the total area in the AND and OR gates is 576 × 10 −6 µm 2 and in the NOT gate is 276 × 10 −6 µm 2 . The base gates are fully optimized and latency is equal to 0.25 clockcycle or 0.25 × 10 −12 s, which is reduced in comparison with prior works. Also, the power consumption of a cell in terms of quantum calculation and the proposed model is also investigated.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here