Low Complexity Design of Ripple Carry and Brent–Kung Adders in QCA

The design of adders on quantum dot cellular automata (QCA) has been of recent interest. While few designs exist, investigations on reduction of QCA primitives (majority gates and inverters) for various adders are limited. In this paper, we present a number of new results on majority logic. We use these results to present efficient QCA designs for the ripple carry adder (RCA) and various prefix adders. We derive bounds on the number of majority gates for -bit RCA and -bit Brent-Kung, Kogge-Stone, Ladner-Fischer, and Han-Carlson adders. We further show that the Brent-Kung adder has lower delay than the best existing adder designs as well as other prefix adders. In addition, signal integrity and robustness studies show that the proposed Brent-Kung adder is fairly well-suited to changes in time-related parameters as well as temperature. Detailed simulations using QCADesigner are presented.

[1]  E. Swartzlander,et al.  Adder Designs and Analyses for Quantum-Dot Cellular Automata , 2007, IEEE Transactions on Nanotechnology.

[2]  H. S. Miller,et al.  Majority-Logic Synthesis by Geometric Methods , 1962, IRE Trans. Electron. Comput..

[3]  Rui Zhang,et al.  Synthesis of majority and minority networks and its applications to QCA, TPL and SET based nanotechnologies , 2005, 18th International Conference on VLSI Design held jointly with 4th International Conference on Embedded Systems Design.

[4]  Israel Koren.  Computer arithmetic algorithms , 1993 .

[5]  Richard Lindaman,et al.  A Theorem for Deriving Majority-Logic Networks Within an Augmented Boolean Algebra , 1960, IRE Trans. Electron. Comput..

[6]  W. Porod.  Quantum-dot devices and Quantum-dot Cellular Automata , 1997 .

[7]  Edward M. Riseman,et al.  A Realization Algorithm Using Three-Input Majority Elements , 1967, IEEE Trans. Electron. Comput..

[8]  Harold S. Stone,et al.  A Parallel Algorithm for the Efficient Solution of a General Class of Recurrence Equations , 1973, IEEE Transactions on Computers.

[9]  G.A. Jullien,et al.  A method of majority logic reduction for quantum cellular automata , 2004, IEEE Transactions on Nanotechnology.

[10]  Richard Lindaman,et al.  Axiomatic Majority-Decision Logic , 1961, IRE Trans. Electron. Comput..

[11]  Sheldon B. Akers,et al.  Synthesis of combinational logic using three-input majority gates , 1962, SWCT.

[12]  P. D. Tougaw,et al.  Logical devices implemented using quantum cellular automata , 1994 .

[13]  S. Bhanja,et al.  Probabilistic Modeling of QCA Circuits Using Bayesian Networks , 2006, IEEE Transactions on Nanotechnology.

[14]  Earl E. Swartzlander,et al.  Adder and Multiplier Design in Quantum-Dot Cellular Automata , 2009, IEEE Transactions on Computers.

[15]  Tack-Don Han,et al.  Fast area-efficient VLSI adders , 1987, 1987 IEEE 8th Symposium on Computer Arithmetic (ARITH).

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

[17]  Jing Huang,et al.  Design and Test of Digital Circuits by Quantum-Dot Cellular Automata , 2007 .

[18]  Ismo Hänninen,et al.  Robust Adders Based on Quantum-Dot Cellular Automata , 2007, 2007 IEEE International Conf. on Application-specific Systems, Architectures and Processors (ASAP).

[19]  George W. Hanson,et al.  Fundamentals of Nanoelectronics , 2007 .

[20]  Graham A. Jullien,et al.  Implementation of a Simulation Engine for Clocked Molecular QCA , 2006, 2006 Canadian Conference on Electrical and Computer Engineering.

[21]  Michael T. Niemier,et al.  Fabricatable Interconnect and Molecular QCA Circuits , 2007, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[22]  P. D. Tougaw,et al.  A device architecture for computing with quantum dots , 1997, Proc. IEEE.

[23]  Vikram Pudi,et al.  Efficient Design of a Hybrid Adder in Quantum-Dot Cellular Automata , 2011, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[24]  Ramesh Karri,et al.  The Robust QCA Adder Designs Using Composable QCA Building Blocks , 2007, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[25]  Peter M. Kogge,et al.  Probabilistic Analysis of a Molecular Quantum-Dot Cellular Automata Adder , 2007, 22nd IEEE International Symposium on Defect and Fault-Tolerance in VLSI Systems (DFT 2007).

[26]  Yong-Bin Kim,et al.  QCA-based nano circuits design [adder design example] , 2005, 2005 IEEE International Symposium on Circuits and Systems.

[27]  Wei Wang,et al.  Performance Comparison of Quantum-dot Cellular , 2005 .

[28]  C. Lent,et al.  Power gain and dissipation in quantum-dot cellular automata , 2002 .

[29]  T.J. Dysart,et al.  > Replace This Line with Your Paper Identification Number (double-click Here to Edit) < 1 , 2001 .

[30]  H. T. Kung,et al.  A Regular Layout for Parallel Adders , 1982, IEEE Transactions on Computers.

[31]  Peter M. Kogge,et al.  Analyzing the Inherent Reliability of Moderately Sized Magnetic and Electrostatic QCA Circuits Via Probabilistic Transfer Matrices , 2009, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[32]  Graham A. Jullien,et al.  Design Tools for an Emerging SoC Technology: Quantum-Dot Cellular Automata , 2006, Proceedings of the IEEE.

[33]  Graham A. Jullien,et al.  Simulation of random cell displacements in QCA , 2007, JETC.

[34]  E.E. Swartzlander,et al.  Modular Design of Conditional Sum Adders Using Quantum-dot Cellular Automata , 2006, 2006 Sixth IEEE Conference on Nanotechnology.

[35]  Fusachika Miyata,et al.  Realization of Arbitrary Logical Functions Using Majority Elements , 1963, IEEE Trans. Electron. Comput..

[36]  S. Bhanja,et al.  Estimation of Upper Bound of Power Dissipation in QCA Circuits , 2009, IEEE Transactions on Nanotechnology.

[37]  S. Akers.  On the Algebraic Manipulation of Majority Logic , 1961 .