A Comparative Analysis of CNF and XOR-AND Representations for QCA Majority Gate Estimation

Complimenting the rising research of reversible computation, Quantum Dot Cellular Automata (QCA) has emerged as a potential alternative for CMOS. Although in its nascent stage, QCA promises logical reversibility; thereby adhering to the near zero power dissipation attribute of reversibility. Architectures built using quantum dot cells are majorly cascades of Majority Voters - the fundamental gate in QCA. This study investigates two predictive procedures to pre-determine the number of Majority Voters required for realizing a given Boolean function on QCA platform. One procedure utilizes the concept of optimized XOR-AND formulation of a Boolean function represented in CNF whereas the other procedure determines the Majority Voter count based on Karnaugh map approach. Pre-determination of Majority Voter count can result in analysis of efficiency deciding parameters (area etc.) beforehand, hence the motivation of the study.

[1]  M. Gladshtein,et al.  Quantum-Dot Cellular Automata Serial Decimal Adder , 2011, IEEE Transactions on Nanotechnology.

[2]  Hossam A. H. Fahmy,et al.  Complete logic family using tunneling-phase-logic devices , 2000, ICM'99. Proceedings. Eleventh International Conference on Microelectronics (IEEE Cat. No.99EX388).

[3]  Earl E. Swartzlander,et al.  A First Step Toward Cost Functions for Quantum-Dot Cellular Automata Designs , 2014, IEEE Transactions on Nanotechnology.

[4]  Yun Shang,et al.  An Optimized Majority Logic Synthesis Methodology for Quantum-Dot Cellular Automata , 2010, IEEE Transactions on Nanotechnology.

[5]  M. Kastner,et al.  The single-electron transistor , 1992 .

[6]  Joel L. Schiff,et al.  Cellular Automata: A Discrete View of the World (Wiley Series in Discrete Mathematics & Optimization) , 2007 .

[7]  Timothy J. Dysart.  Modeling of Electrostatic QCA Wires , 2013, IEEE Transactions on Nanotechnology.

[8]  Omar Dajani,et al.  Emerging Design Methodology And Its Implementation Through Rns And Qca , 2013 .

[9]  E. W. Johnson,et al.  Programmable Logic Implemented Using Quantum-Dot Cellular Automata , 2012, IEEE Transactions on Nanotechnology.

[10]  C. Dekker,et al.  Logic Circuits with Carbon Nanotube Transistors , 2001, Science.

[11]  Wolfgang Porod,et al.  Quantum cellular automata , 1994 .

[12]  Wolfgang Porod,et al.  Quantum-dot cellular automata : computing with coupled quantum dots , 1999 .

[13]  M. Zamboni,et al.  Majority Voter Full Characterization for Nanomagnet Logic Circuits , 2012, IEEE Transactions on Nanotechnology.

[14]  New Decomposition Theorems on Majority Logic for Low-Delay Adder Designs in Quantum Dot Cellular Automata , 2012, IEEE Transactions on Circuits and Systems II: Express Briefs.

[15]  Stefania Perri,et al.  Area-Delay Efficient Binary Adders in QCA , 2014, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[16]  Mansoor Alam,et al.  Synthesis of Majority/Minority Logic Networks , 2015, IEEE Transactions on Nanotechnology.