Radix-8 full adder in QCA with single clock-zone carry propagation delay

Abstract We design a 3-bit adder or a radix-8 full adder (FA) in quantum-dot cellular automata (QCA), where the 3-bit carry propagation path can be accommodated in one clock-zone. To achieve this, we introduce group majority signals similar to group propagate and generate signals in parallel prefix computations, use them to reformulate the carry expressions of a previous radix-4 FA, and as such we could extend it to higher radix FAs. Applying the aforementioned new interpretation of carry expressions (via group majority signals) on 3-bit adders, results in that only a single clock cycle is required for 12-bit (vs. the previous 8-bit) carry propagation, across four radix-8 FAs. Based on the proposed radix-8 QCA-FA, we realized 8-, 16-, 32-, 64, and 128-bit QCA adders via QCADesigner. Comparison of these adders with the previous radix-4 experiment, showed 9–41% speed up, and 57–76% area saving, for 16–128-bit adders, respectively. On the other hand, compared to the best previous radix-2 design, for the same bit widths, we experienced 57–172% speed up, but at the cost of 138–4% area increase, except for the 64 and 128-bit cases, where we also experienced 19% and 41% area saving, respectively.

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

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

[3]  Milad Sangsefidi,et al.  Coplanar Full Adder in Quantum-Dot Cellular Automata via Clock-Zone-Based Crossover , 2015, IEEE Transactions on Nanotechnology.

[4]  S. Perri,et al.  New Methodology for the Design of Efficient Binary Addition Circuits in QCA , 2012, IEEE Transactions on Nanotechnology.

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

[6]  Ramesh Karri,et al.  Towards designing robust QCA architectures in the presence of sneak noise paths , 2005, Design, Automation and Test in Europe.

[7]  K. Sridharan,et al.  Design of Ripple Carry and Prefix Adders in QCA , 2015 .

[8]  Dariush Abedi,et al.  Coplanar QCA serial adder and multiplier via clock-zone based crossover , 2015, 2015 18th CSI International Symposium on Computer Architecture and Digital Systems (CADS).

[9]  Yong-bin Kim,et al.  Challenges for Nanoscale MOSFETs and Emerging Nanoelectronics , 2010 .

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

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

[12]  Behrooz Parhami,et al.  Computer arithmetic - algorithms and hardware designs , 1999 .

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

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