New Decomposition Theorems on Majority Logic for Low-Delay Adder Designs in Quantum Dot Cellular Automata

The design of low-delay multibit adders in quantum dot cellular automata is considered in this brief. We present a general approach for delay reduction based on two new theorems called decomposition theorems. We consider the carry-lookahead adder (CLA) and the carry-flow adder (CFA) as specific applications of the theorems. For 16-bit CLA and 16-bit CFA, the decomposition theorems yield reductions in delay for the leading carry of approximately 60% and 25%, respectively, when compared to the best existing designs. In addition, the decomposition theorems lead to designs with low area-delay product. Simulations in QCADesigner are also presented.

[1]  Hongbing Zhu,et al.  A Pipeline Structure for the Sequential Boltzmann Machine (Special Section of Papers Selected from ITC-CSCC '98) , 1999 .

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

[3]  Wei Wang,et al.  Quantum-dot cellular automata adders , 2003, 2003 Third IEEE Conference on Nanotechnology, 2003. IEEE-NANO 2003..

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

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

[6]  Yair Wiseman,et al.  A Pipeline Chip for Quasi Arithmetic Coding , 2001 .

[7]  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).

[8]  Donatella Sciuto,et al.  An efficient Quantum-Dot Cellular Automata adder , 2011, 2011 Design, Automation & Test in Europe.

[9]  Vincenzo Piuri,et al.  Pipelined Adders , 1996, IEEE Trans. Computers.

[10]  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.

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

[12]  K. Sridharan,et al.  Low Complexity Design of Ripple Carry and Brent–Kung Adders in QCA , 2012, IEEE Transactions on Nanotechnology.

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

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

[15]  Alexander Yu. Vlasov,et al.  On Quantum Cellular Automata , 2004, ArXiv.

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