Reversible Logic-Based Fault-Tolerant Nanocircuits in QCA

Parity-preserving reversible circuits are gaining importance for the development of fault-tolerant systems in nanotechnology. On the other hand, Quantum-dot Cellular Automata (QCA), a potential alternative to CMOS, promises efficient digital design at nanoscale.Thiswork targets design of reversibleALU (arithmetic logic unit) inQCA (Quantum-dotCellularAutomata) framework. The design is based on the fault tolerant reversible adders (FTRA) introduced in this paper. The proposed fault tolerant adder is a parity-preserving gate, and QCA implementation of FTRA achieved 47.38% fault-free output in the presence of all possible single missing/additional cell defects. The proposed designs are verified and evaluated over the existing ALU designs and found to be more efficient in terms of design complexity and quantum cost.


Introduction
Reversible logic has attractive perspective of constructing digital devices that can realize computing unit with almost zero power dissipation.Landauer [1] proved that for irreversible computations, each bit of information loss generates   2 joules of heat energy.The energy  bit required for a binary transition is given by SNL (Shannon-Von Neumann-Landauer) expression in [1] as follows: where   is Boltzmann constant and  = 300 K.This is the minimum energy to process a bit.Bennett [2] showed that a zero power dissipation in logic circuit is possible only if the circuit is composed of reversible logic gates.Since QCA circuits are clocked information preserving systems, the energy dissipation of QCA circuits can be significantly lower than   2.This feature favours the introduction of QCA technology in reversible logic design.Though, reversibility recovers bit loss, but it is not able to detect bit error in circuit.Fault-tolerant reversible circuits are capable of preventing errors at outputs.If the system itself made of fault-tolerant components, then the detection and correction of faults become easier and simple.In communication and many other systems, fault tolerance is achieved by parity.Therefore, parity-preserving reversible circuits will be the future design trends to the development of fault-tolerant reversible systems in nanotechnology.
On the other hand, QCA (Quantum-dot Cellular Automata) is considered to be promising in the field of nanotechnology due to their extremely small sizes and ultralow-power consumption [3].The QCA is based on encoding binary information in the charge configuration of quantum-dot cells.The interaction between cells is coulombic and provides the necessary computing power.The fundamental unit of QCAbased design is the 3-input majority gate [3].Majority gate with inverter, called MI, is used to realize the QCA designs because of its functional incompleteness.
This motivates us to design a fault-tolerant reversible ALU architecture considering QCA technology.A cost-effective realization of a fault-tolerant reversible adder (FTRA) is first introduced.It is then utilized to synthesize the desired faulttolerant reversible arithmetic logic unit which outperforms the efficiency of existing designs in terms of design complexity and quantum cost.The major contributions of this work around reversible QCA architecture can be summarized as follows: (i) realization of generic fault-tolerant reversible adder having parity-preserving logic with cost effective quantum cost; (ii) the presented fault-tolerant reversible adder block is used to realize different arithmetic circuit such as full adder, subtractor, ripple carry adder, and carry-skip logic; (iii) synthesis of a fault-tolerant reversible arithmetic logic unit (ALU) using proposed adder; (iv) application of the proposed adder in QCA nanotechnology with effective fault tolerance of 47.38% in the presence of all possible single missing/additional cell defects.
Simulations using QCADesigner [11] supports all the results presented.

Preliminaries
Reversible Logic.A logic gate is reversible if the mapping of its inputs to outputs is bijective; that is, every distinct input yields a distinct output, and the number of inputs is equal to the number of outputs [12].An important cost metrics in reversible logic circuits is the quantum cost.The cost of every 2 × 2 gate is the same; that is, unity and the cost of 1 × 1 gate are zero [13].Any reversible logic can be realized using primitive quantum gates, like 1 × 1 NOT gates and 2 × 2 reversible gates, such as Controlled-, Controlled- + , and CNOT gate (Figure 1).The quantum cost of a reversible gate can be calculated by counting the numbers of primitive quantum gates used in implementing it.The fan-outs and feedback paths are not permitted in reversible logic.
QCA Basics.A QCA cell consists of four quantum dots positioned at the corners of a square (Figure 2(a)) and contains two free electrons [3].The electrons can quantum mechanically tunnel among the dots and settle either in polarization P = −1 (logic 0) or in P = +1 (logic 1) as shown in Inverter is realized in two different orientations as shown in Figure 2(d).In QCA-based logic implementations, two kinds of wire crossover, termed coplanar crossover and multilayer crossover, are possible.Figure 2(e) describes the coplaner wire crossing considering a 90 ∘ (×-cell) and a 45 ∘ (+-cell) structures.
Fault-Tolerant Logic.Fault tolerance enables a system to operate properly in the event of the failure of some its components.
If the system itself is made up of fault-tolerant components, then the detection and correction of faults become easier and simple.A fault-tolerant (FT) reversible gate is also called conservative gate [7].The hamming weight of its inputs and outputs is equal.Let the input and output vectors of any faulttolerant gate be  V =  0 ,  1 , . . .,  −1 and  V =  0 ,  1 , . . .,  −1 , where Few fault-tolerant reversible 3 × gate-like Feynman double gate (F2G), Fredkin (FRG), NFT, and so forth and 4 × 4 gate like MIG are already investigated.

Related Work
In [14], the feasibility of the parity-preserving approach to design of reversible logic circuits was explored.Few new fault-tolerant reversible logic gates were proposed in [8].Fault-tolerant full adder circuits are explored in [7][8][9][10].In all these researches, no such single logic unit was identified to implement fault-tolerant full adder.Also, the fault tolerance  capability of those logic gates was not explored quantitatively.Significant contributions have been made in the literature towards the design of arithmetic units in [4][5][6].However, there have only been a few efforts towards designing reversible fault-tolerant ALUs.A new fault-tolerant method based on majority multiplexing (Maj-MUX) is proposed for QCA in [15].But the application of reversible logic in QCA to achieve fault tolerance was not identified (which is of primary interest to us in this work).

Proposed Fault-Tolerant Adder
In communication and many other systems, fault tolerance is achieved by parity.A parity-preserving reversible gate, when used with an arbitrary synthesis strategy for reversible logic circuits, allows any fault that affects no more than a single logic signal to be detectable at the circuit's primary outputs [14].In [10], a minimum number of garbage outputs and constant inputs for a fault-tolerant reversible full adder circuit are specified as 3 and 2. Keeping in mind to have minimum number of garbage outputs and constant inputs, a new fault-tolerant reversible adder (FTRA) is proposed here (Figure 3 The proposed reversible FTRA gate is parity preserving.The reversibility and parity preserve nature of the proposed FTRA gate can be verified from Table 1. A fault-tolerant reversible full adder and subtractor circuit using the newly proposed FTRA gate is shown in Figure 4(a).The design uses only one FTRA gate, has a quantum cost of 8, produces 3 garbage outputs, and uses 2 constant inputs only.No such single logic gate is found which can implement a fault-tolerant reversible full adder with such quantum cost and less complexity.Design capability of the proposed adder is further analyzed by implementing a 4bit fault-tolerant ripple carry adder (Figure 4(b)) and carry skip adder (Figure 4(c)).A comparative performance analysis of the proposed design with existing designs is reported in Table 2 with enviable gate count besides other parameters.The results shows that the proposed design is much more effective than the existing designs.
The advantage of our method is in the implementation of this logic at gate level.Thus, once the required gates have been designed and an appropriate synthesis framework has been established, fault-tolerant implementation requires no extra expenditure in design or verification effort.: "two-input EXOR calculation"; : "two-input AND calculation"; : "NOT calculation."

Design of Fault-Tolerant Arithmetic Logic Unit (ALU).
The reversible fault-tolerant 1-bit ALU is designed with one FTRA gate, two Fredkin gates, and four Double-Feynman gates.
Thus the design uses a total of 7 gates and has a quantum cost of 26 (Figure 5).It produces 5 garbage outputs and uses 4 constant inputs.The various operations performed by the proposed FTRA-ALU is shown in Table 3.The total logical operations performed is 21 + 10 + 5.The main advantage of the proposed ALU logic is its programmable feature; that is, just programming the constants C1, C2, and C3, different ALU functions are implemented.Besides its fault tolerance, this programmable feature adds more flexibility in reversible ALU. Figure 6 shows the design of an n-bit fault-tolerant ALU which is synthesized by cascading the 1-bit ALU module explored in Figure 5.

FTRA Gates in QCA Computing
To demonstrate the application of the proposed fault-tolerant design approach to reversible adder in emerging nano-technologies, Quantum-dot cellular automata (QCA) technology is considered because reversible logic has potential applications in QCA computing.The QCA implementation of the proposed FTRA gate is shown in Figure 7.The design requires 27 MVs and has a delay of 12 clock zones.In the following section, the fault tolerance capability is established quantitatively.FTRA simulation shown in Figure 8 is performed by fixing D and E to 0. In this simulation result, R generates sum, and S propagates carry.

Fault Tolerance of Proposed Logic Gate
In QCA manufacturing, defects can occur during the synthesis and deposition phases, although defects are most likely to take place during the deposition phase [16].Researchers have shown that QCA cells are more susceptible to missing and additional QCA cell defects [17].In additional cell defect, an additional cell is deposited on the substrate.The missing cell defect occurs due to the missing of a particular cell.
Researchers have been addressing the design and test of QCA circuits assuming the single missing/additional cell defect model.In the proposed work, the QCA layout of the FTRA gate is converted into the corresponding hardware description language notations using the HDLQ Verilog library [18].The HDLQ design tool, Verilog equivalent for QCA, consists of a Verilog HDL library of QCA devices, that is, MV, INV, FO, Crosswire (CW), and L-shape wire with fault injection capability.The HDLQ-modeled design of the FTRA gate is shown in Figure 9, and an exhaustive testing of the HDLQ model of the FTRA gate is conducted with 32 input patterns in the presence of all possible single missing/additional cell defects.The design is simulated using the Verilog HDL simulator in the presence of faults to determine the corresponding outputs.
Testing of the FTRA gate generated 78 unique fault patterns at the output, as shown in Table 4. Due to huge volume of data, the fault pattern table is partially shown.In the fault patterns study shown in the Table 4,   is the five-bit pattern with an equivalent decimal value of .For example,  0 represents 00000 (decimal 0), and  31 represents 11111 (decimal 31).In Table 4, first two columns present the correct behaviour of FTRA gate, that is, for a particular input vector corresponding expected output vector.Each row of the Table 4 represents the output generated after the fault injection of different 78 modules of the HDLQ model (Figure 9), for example, for given input  0 , after the fault injection of different modules, the generated fault pattern is  0 ,  16 ,  12 , . . .,  1 ,  0 .From those fault patterns, we observed that there are average 47.38% successful patterns that produce the correct output, even when there is a fault.

Conclusions
This work presents a novel architecture of fault-tolerant reversible adder (FTRA) gate.Experimental results establish the fact that the proposed FTRA achieved significant improvements in reversible circuits over the existing ones.A reversible arithmetic logic unit is synthesized based on the FTRA proposed.This is first attempt to synthesize a fault-tolerant full adder/subtractor using only single reversible logic block (FTRA) with optimal quantum cost to avoid wire-crossing bottleneck.Also, the application of this fault-tolerant logic in QCA nanotechnology gets an extra advantage in fault-tolerant computing with effective 47.38% fault-free output in the presence of all possible single missing/additional cell defects.
Though, the clocking structure beneath the QCA cell layer is also very important and nontrivial research issue.

Figure 2 (
b). Timing in QCA is accomplished by the cascaded clocking of four distinct and periodic phases[3].The basic structure realized with QCA is the 3-input majority gate, MV (A, B, C) = Maj (A, B, C) = AB + BC + CA (Figure2(c)).It can also function as a 2-input AND (2-input OR) logic by fixing one of the three input cells to P = −1 (P = +1).
(a)) followed by design of different adder-based circuits.The input to output mapping of FTRA structure is P = A, Q = A⊕B, R = A⊕B⊕C⊕D, S = (A⊕B)(C⊕D)(AB⊕D), and T = (A ⊕ B)(C ⊕ D)(AB ⊕ D) ⊕ E, where A, B, C, D, and E are inputs and P, Q, R, S, and T are outputs.It is a 5 × 5 reversible gate with a quantum cost of 8 (Figure 3(b)).

Figure 4 :
Figure 4: Implementation of different logic circuit with proposed FTRA.

Table 1 :
Truth table of proposed fault-tolerant adder.

Table 2 :
Performance analysis of different fault-tolerant full adders.

Table 3 :
Different function of ALU.

Table 4 :
Fault pattern of proposed fault-tolerant adder.