DOI : 10.17577/IJERTCONV2IS07002

Download Full-Text PDF Cite this Publication

Text Only Version


P.SIVARAJ Mr.S.Manthandi PeriyannaSamy M.E.,(Ph.D) Mr.C.Kavin Prakash M.E., Dept.of ECE Professor / ECE Professor / ECE

VKS College of Engineering & Technology, VKS College of Engineering & Technology, VKS College of Engineering & Technology, Karur, Tamilnadu, India Karur, Tamilnadu, India Karur, Tamilnadu, India Sivaraj1904@gmail.com

ABSTRACT–The area and complexity are the major issues in circuit design. Here, we propose different types of adder designs based on Quantum dot Cellular Automata (QCA) that reduces number of QCA cells and area compare to previous designs. The quantum dot cellular automata can implement digital circuits with faster speed, smaller size and low power consumption. The QCA cell is a basic building block of nanotechnology that can be used to make gates, wires and memories. The basic logic circuits used in this technology are the inverter and the Majority Gate (MG), using this other logical circuits can be designed. In this paper, the adders such as half, full and serial bit were designed and analyzed. These structures were designed with minimum number of cells by using cell minimization techniques. The techniques are using two cells inverter and suitable arrangement of cells without overlapping of neighboring cells. The proposed method can be used to minimize area and complexity. These circuits were designed by majority gate and implemented by QCA cells. Then, they simulated using QCA Designer. The Simulated results were verified according to the truth table. The performance analyses of those circuits are compared according to complexity, area and number of clock cycles and are also compared with previous designs.

Index TermsAdders, nanocomputing, quantum-dot cellular automata (QCA).


    1. An Introduction to the Problem

      In 1965, Gordon Moore predicted that the number of transistors that could be integrated into a single die would grow exponentially with time. Moore's law has governed microprocessor manufacturing processes, and consequently microprocessor performance ever since. However, recent studies indicate that during the next two decades, the laws of nature will begin to govern microprocessor design and fabrication. Today many integrated circuits are manufactured at 0.25-0.33 micron processes. As device sizes decrease to an order of 0.05 microns (a technology that is currently unrealizable), physical limitations of conventional electronics including power consumption, Interconnect, and lithography will become increasingly difficult [10].

    2. An (Alternative) Solution

      As an alternative to CMOS-VLSI, researchers have proposed an approach to computing with quantum dots, the

      Quantum cellular automata (QCA). First proposed 1 in 1994, unlike conventional computers in which information is transferred from one place to another by means of electrical current, QCA transfers information by propagating a polarization state [12, 11]. QCA is based upon the encoding of binary information in the charge configuration within quantum dot cells. Computational power is provided by the Coulombic interaction between QCA cells. No current between cells and no power or information is delivered to individual internal cells. The local interconnections between cells are provided by the physics of cell-to-cell interaction due to the rearrangement of electron positions [12]. While there is still much work to be done, early experimental results indicate that QCA may be an extremely viable alternative to CMOS. QCA cells and a simple QCA logical device have been successfully fabricated and tested [3].

      The rest of this brief is organized as follows: a brief back- ground of the QCA technology II and III. QCA Standard Functions existing adders designed in QCA is given in Section IV, the novel adder design is then introduced in Section V, and QCA Implementation and Tables VI finally, in Section VII conclusions are drawn.


        A QCA is a nanostructure having as its basic cell a square four quantum dots structure charged with two free electrons able to tunnel through the dots within the cell [1]. Because of Coulombic repulsion, the two electrons will always reside in opposite corners. The locations of the electrons in the cell (also named polarizations P) determine two possible stable states that can be associated to the binary states 1 and 0.

        Although adjacent cells interact through electrostatic forces and tend to align their polarizations, QCA cells do not have intrinsic data flow directionality. To achieve controllable data directions, the cells within a QCA design are partitioned into the so-called clock zones that are progressively associated to four clock signals, each phase shifted by 90°.

        This clock scheme, named the zone clocking scheme, makes the QCA designs intrinsically pipelined, as each clock zone behaves like a D-latch.

          1. QCA Design Architecture

            1. Basics of QCA:

              The basic elements of QCA are QCA cell, Majority gate and Invertor. These is important elements. In QCA cell each cell is having four quantum dots and is having two free

              electrons. The locations of the electrons determine the binary states.Fig.1 shows the QCA cell diagram.

              Fig.1 QCA Cell Polarization.

            2. QCA Cell:

              A quantum-dot cellular automata (QCA) is a square nanostructure of electron wells having free electrons. Each cell has four quantum dots [2].The four dots are located in the four corners .The cell can be charged with two free electrons. By using the clocking mechanism, the electrons tunnel to proper location during the clock transition. Thus there exist two equivalent energetically arrangements of the two electrons in the QCA cell as shown in Fig.1.These two arrangements can represent logic 1 and logic 0 respectively so that binary information can be encoded. Invertor is represented in Fig.2 and Majority gate in Fig.3.

              Fig.2. Invertor

              Fig.3. Majority gate

              A QCA design permits two options for crossover, termed coplanar crossover and multilayer crossover. While the coplanar crossover uses only one layer but involves usage of two cell types (termed regular and rotated), the multilayer crossover uses more than one layer of cells (analogous to multiple metal layers in a conventional IC). The multilayer crossover is used in this paper for wire crossings since we can effectively cross signals over on another layer and the extra layers of QCA can be used as active components of the circuit. Further, multilayer QCA circuits can potentially consume much less area as compared to planar circuits. Moreover, some studies indicate that coplanar crossover is difficult to fabricate in the molecular implementation.

            3. A Simple QCA Circuit

        To implement more complicated logical functions, a subset of simple logical gates is required. For example, it would

        be impossible to implement a multiplexor, decoder, or adder in QCA without a logical AND gate, OR gate, or inverter. It has been demonstrated that a value's complement can be obtained simply by ripping it o_ a 45-degree wire at the proper location. Implementing the logical AND and OR functions is also quite simple. The logical function for the majority gate is:

        Y = AB + BC + AC

        The AND function can be implemented by setting one value (A, B, or C) in equation to a logical 0. Similarly, the OR function can be implemented by Setting one value (A, B, or C) in equation to a logical 1. This result s in the equaions:

        AND = AB + B(0) + A(0) = AB OR = AB + B(1) + A(1) = A + B

        It is worth noting that because this property exists (i.e. the ability to generate the AND and OR functions) and given the fact that it is possible to obtain the inverse of a signal value, the QCA logic set is functionally complete meaning that any logical circuit can be generated with QCA devices. More complex logical circuits (such as the multiplexor can then be constructed from at least AND and OR gates if not clever combinations of majority gates. QCA cells labeled anchored in have their electron polarization frozen to successfully implement AND and OR functions.


        The three variables A,B and C to facilitate the conversion of a sum of-products expression to minimized majority logic. Based on that to obtain the efficient majority expression for any given three-variable Boolean function amenable to QCA implementation. The simplified majority expressions for some standard functions are given in the table. The AND and OR gates are realized by fixing the polarization to one of the inputs of the majority gate to either P = 1 (logic

        0) or P = 1 (logic 1).

        Fig. 4 .Layout of AND and OR gates.

        The NAND function is the complement of AND functions. It is realized by connecting AND gate (MG) followed by an inverter. Similarly the NOR gate is realized by connecting OR gate (MG) followed by an inverter. If the last two cells are arranged as shown in the following figure then it acts as an inverter. By using this 2cell inverter, the area required and complexity can be minimized.

        Fig. 5 .Layout of NAND gate.

        Fig. 6 .Layout of NOR gate

        The XOR is a logical operation on two operands that results in a logical value of true if and only if one of the operands, but not both, has a value of true. This forms a fundamental logic gate in many operations to follow. The realization is done making use of majority gates (MGs) and following the equations as follows

        Fig.7.XOR schematic

        Fig.8. Layout of XOR gate

        Fig.9.Ex-NOR schematic.

        Fig.10. Layout of Ex-NOR gate


        In this section, we first existing a new QCA addition algorithm and the corresponding one-bit QCA adder structure that reduces the number of the majority gates and inverters required by existing designs [5]-[6]. Then, we demonstrate that, using this structure, we can obtain efficient carry look ahead n- bit QCA adders.

        4.1. Existing QCA Adders

        We now introduce a new design of one-bit QCA adder based on the proposed algorithm. The proposed one-bit QCA adder consists of three majority gates and two inverters. It results in reduced hardware compared to the original full adder [5], [6] and retains the simple clocking scheme.

        It is noted that the bit-serial QCA adder [7] uses a variant of the proposed one-bit QCA adder. To create an n-bit adder, we arrange n proposed one-bit adders vertically in a column. The clocking of the cells within the n-bit adder is designed such that the carry will propagate down to the last bit before the sum is calculated, thereby implementing a CLA adder. The proposed QCA adder design requires fewer majority gates and inverters while maintaining the same clocking scheme and speed in comparison with existing QCA adders. Compared to the bit-serial QCA adder, the proposed design is n times faster, at the expense of being approximately n times larger in area. Furthermore, the complicated feedbacks control.

        Fig 11: Existing one-bit QCA full adder

        1. NOVEL QCA ADDER

          To introduce the novel architecture proposed for implementing ripple adders in QCA, let consider two n-bit addends A = an1, . . . , a0 and B = bn1, . . . , b0 and suppose that for the I th bit position (with i = n 1, . . . , 0) the auxiliary propagate and generate signals, namely pi = ai + bi and gi = ai · bi , are computed. ci being the carry produced at the generic (i1) bitposition, the carry signal ci+2, furnished at the (i+1)th bit position, can be computed using the conventional CLA logic reported in (2). The latter can be rewritten as given in (3), by exploiting Theorems 1 and 2 demonstrated in [15]. In this way, the RCA action, needed to propagate the carry ci through the two subsequent bit positions, requires only one MG. Conversely, conventional circuits operating in the RCA fashion, namely the RCA and the CFA, require two cascaded MGs to perform the same operation.

          Fig 12: Novel 2-bit basic module.

          In other words, an RCA adder designed as proposed has a worst case path almost halved with respect to the conventional RCA and CFA is exploited in the design of the novel 2-bit module shown in Fig. 1 that also shows the computation of the carry ci+1 = M(pi gici ). The proposed n-bit adder is then implemented by cascading n/2 2-bit modules. Having assumed that the carry-in of the adder iscin = 0, the signal p0 is not required and the 2-bit module used at the least significant bit position is simplified.


          6.1 Implementation of Adders using QCA

          Fig.13 Design of Half Adder using QCA

          Fig.14. Design of Full adder using two half adder in QCA

          Fig.15. Design of Full adder using QCA.

          Fig.16. Design of 8-bit Ripple Carry Adder using QCA. Fig 17.Graph comparing different adders.

        3. CONCLUSION

A new adder designed in QCA was presented. It achieved speed performances higher than all the existing QCA adders, with an area requirement comparable with the cheap RCA and CFA demonstrated in [13] and [16]. The novel adder operated in the RCA fashion, but it could propagate a carry signal through a number of cascaded MGs significantly lower than conventional RCA adders. In addition, because of the adopted basic logic and layout strategy, the number of clock cycles required for completing the elaboration was limited. A 64-bit binary adder designed as described in this brief exhibited a delay of only nine clock cycles, occupied an active area of

18.72 m2, and achieved an ADP of only 168.48.


  1. C. S. Lent, P. D. Tougaw, W. Porod, and G. H. Bernestein,

    Quantum cellular automata, Nanotechnology, vol. 4, no. 1, pp. 4957, 1993.

  2. M. T. Niemer and P. M. Kogge, Problems in designing with QCAs: Layout = Timing, Int. J. Circuit Theory Appl., vol. 29, no. 1, pp. 4962, 2001.

  3. J. Huang and F. Lombardi, Design and Test of Digital Circuits by Quantum-Dot Cellular Automata. Norwood, MA, USA: Artech House, 2007.

  4. W. Liu, L. Lu, M. ONeill, and E. E. Swartzlander, Jr.,

    Design rules for quantum-dot cellular automata, in Proc. IEEE Int. Symp. Circuits Syst., May 2011, pp. 23612364.

  5. K. Kim, K. Wu, and R. Karri, Toward designing robust QCA architectures in the presence of sneak noise paths, in Proc. IEEE Design, Autom. Test Eur. Conf. Exhibit., Mar. 2005, pp. 1214 1219.

  6. K. Kong, Y. Shang, and R. Lu, An optimized majority logic synthesis methology for quantum-dot cellular automata, IEEE Trans. Nanotechnol., vol. 9, no. 2, pp. 170183, Mar. 2010.

  7. K. Walus, G. A. Jullien, and V. S. Dimitrov, Computer arithmetic structures for quantum cellular automata, in Proc. Asilomar Conf. Sygnals, Syst. Comput., Nov. 2003, pp. 1435 1439.

  8. J. D. Wood and D. Tougaw, Matrix multiplication using quantumdot cellular automata to implement conventional microelectronics, IEEE Trans. Nanotechnol., vol. 10, no. 5, pp. 10361042, Sep. 2011.

  9. K. Navi, M. H. Moaiyeri, R. F. Mirzaee, O. Hashemipour, and B. M. Nezhad, Two new low-power full adders based on majority-not gates, Microelectron. J., vol. 40, pp. 126130, Jan. 2009.

  10. L. Lu, W. Liu, M. ONeill, and E. E. Swartzlander, Jr.,

    QCA systolic array design, IEEE Trans. Comput., vol. 62, no. 3, pp. 548560, Mar. 2013.

  11. H. Cho and E. E. Swartzlander Adder design and analyses for quantum-dot cellular automata, IEEE Trans. Nanotechnol., vol. 6, no. 3, pp. 374383, May 2007.

  12. H. Cho and E. E. Swartzlander, Adder and multiplier design in quantum-dot cellular automata, IEEE Trans. Comput., vol. 58, no. 6, pp. 721727, Jun. 2009.

  13. V. Pudi and K. Sridharan, Low complexity design of ripple carry and BrentKung adders in QCA, IEEE Trans. Nanotechnology., vol. 11, no. 1, pp. 105119, Jan. 2012.

  14. V. Pudi and K. Sridharan, Efficient design of a hybrid adder in quantum dot cellular automata, IEEE Trans. Very Large Scale Integr. (VLSI) Syst., vol. 19, no. 9, pp. 15351548, Sep. 2011.

  15. S. Perri and P. Corsonello, New methodology for the design of efficient binary addition in QCA, IEEE Trans. Nanotechnol., vol. 11, no. 6, pp. 11921200, Nov. 2012.

  16. V. Pudi and K. Sr idharan, New decomposition theorems on majoritylogic for low-delay adder designs in quantum dot cellular automata, IEEE Trans. Circuits Syst. II, Exp. Briefs, vol. 59, no. 10, pp. 678682, Oct. 2012.

  17. K. Walus and G. A. Jullien, Design tools for an emerging SoC technology: Quantum-dot cellular automata, Proc. IEEE, vol. 94, no. 6, pp. 12251244, Jun. 2006.

  18. S. Bhanja, M. Ottavi, S. Pontarelli, and F. Lombardi,

    QCA circuits for robust coplanar crossing, J. Electron. Testing, Theory Appl., vol. 23, no. 2, pp. 193210, Jun. 2007.

  19. A. Gin, P. D. Tougaw, and S. Williams, An alternative geometry for quantum dot cellular automata, J. Appl. Phys., vol. 85, no. 12, pp. 82818286, 1999.

  20. A. Chaudhary, D. Z. Chen, X. S. Hu, and M. T. Niemer,

Fabricatable interconnect and molecular QCA circuits, IEEE Trans. Comput. Aided Design Integr. Circuits Syst., vol. 26, no. 11, pp. 19771991, Nov. 2007.



Leave a Reply