• Corpus ID: 45765649

Design of various Logic gates and Multiplexer in QCA

  title={Design of various Logic gates and Multiplexer in QCA},
  author={C. S. Udhayakumar and M. Ishwarya Niranjana and R. Gowrimanohari and E. Arun Kumar},
As transistors decrease in size more and more of them can be accommodated in a single die, thus increasing chip computational capabilities. However, transistors cannot get much smaller than their current size. The Quantum-dot Cellular Automata (QCA) approach represents one of the possible solutions in overcoming this physical limit. Quantum-dot Cellular Automata (QCA) is a novel nanotechnology that promises smaller size, lower power consumption, with faster speed and is considered as a solution… 

Figures and Tables from this paper

Designing nanotechnology QCA–multiplexer using majority function-based NAND for quantum computing

  • J. Jeon
  • Computer Science
    The Journal of Supercomputing
  • 2020
A new multiplexer based on three NAND gates in QCA is proposed and designed and verified not only to minimize time and space complexity but also to minimize energy loss.

Design of Low Hardware Complexity Multiplexer Using NAND Gates on Quantum-Dot Cellular Automata

A novel 2-to-1 multiplexer using three NAND gates in QCA using a new equation using De Morgan’s law to reduce a hardware complexity and minimizing a wasted cell is proposed.

Implementation of Multilayer Based Reversible Gate Using Quantum-Dot Cellular Automata

The main target of designing reversible gate is to decrease the number of cells, and the new reversible gate using multilayer structure is suitable for design a reversible full adder.



New Methodology for the Design of Efficient Binary Addition Circuits in QCA

A new design method is proposed that exploits in original ways the properties of auxiliary propagate and generates signals to reduce the number of majority gates required to implement adders in QCA and/or the addition time.

A novel QCA multiplexer design

A novel and efficient design of 2:1 multiplexer in the QCA is proposed that is completely robust and more sustainable to high input frequency, as compared to other designs.

Design and implementation of quantum cellular automata based novel parity generator and checker circuits with minimum complexity and cell count

QCA implementation of combinational circuits like parity generator and checker based on the proposed XOR gate designs are presented, useful for building more complex circuits based on QCA.

Tile-based design of a serial memory in QCA

A novel serial memory architecture for QCA implementation is proposed by which information is moved across a concatenation of tiles by utilizing a two-level clocking mechanism.

Bit-Serial Adder Based on Quantum Dots

A proposed integrated circuit based on quantum-dot cellular automata (QCA) would function as a bit-serial adder. This circuit would serve as a prototype building block for demonstrating the

QCA based multiplexing of 16 arithmetic & logical subsystems-A paradigm for nano computing

The ALFG presented, offers functions beyond a normal ALU such as shift, parity, XOR, rotate and multiplication along with basic operations.

Novel Exclusive-OR Gate and Full Adders Implementation Using Quantum Cellular Automata

A novel exclusive-OR gate and two kinds of full adders, which are composed of quantum cellular automata, are constructed and it is concluded that the design possess more simple architecture and the scale is about half of those circuits constructed by Tougaw et al.

Majority and Minority Network Synthesis With Application to QCA-, SET-, and TPL-Based Nanotechnologies

The first such tool, majority logic synthesizer, is built, on top of an existing Boolean logic synthesis tool, to lay the foundation for research on the development of synthesis methodologies and tools to generate optimized majority/minority networks for these emergent technologies.

Self-aligned double-patterning (SADP) friendly detailed routing

A SADP-aware detailed routing method is proposed that achieves considerable robustness against lithography imperfection in expense of tolerable wire length overhead and performs detailed routing and layout decomposition concurrently to prevent litho-limited layout configurations.

Effective decomposition algorithm for self-aligned double patterning lithography

This is the first published paper with detailed algorithm to perform the SADP decomposition, and the algorithm guarantees to find a decomposition solution with reasonable overlay reduction requirement.