Mr.Parikshit A.Awati Miss. Vaishali Raut
PG Student Dept.Of E&TC Professor,Dept. of
Engg. E&TC Engg, G.H.Raisoni College
G H Raisoni College Of Engg. of Engg. and Management
And Management, University of Pune, Pune,India
University Of Pune vaishali.raut@raisoni.net
Pune India
parikshitawati@gmail.com
Lately, reversible rationale has pulled in individuals' consideration progressively as a result of its application in low power CMOS outline, quantum processing and optical figuring. In this study, we exhibit novel outlines of a few reversible converters that we enhanced as far as quantum expense, refuse yield and steady data. The improved outline of reversible converters exhibited in this work are reversible
Aiken to BCD converter, reversible Binary to Gray converter, reversible Gray to Binary converter, reversible BCD to
Abundance 3 converter and reversible Excess-3 to BCD converter. designers of the 50s saw the conceivable outcomes of building much more propelled circuits than some time recently. Be that as it may, as the intricacy of the circuits developed, issues began emerging .Another issue was the span of the circuits. A complex circuit was dependent on speed. If the components of the computer were too large the electric signals couldn't travel fast enough through the circuit, thus making the computer too slow to be effective. [2]
In this section, basic definitions and ideas related to reversible logic are presented
.
Definition 2.1
Reversible circuits are those circuits that don't lose data and reversible calculation in a framework can be performed just when the framework includes reversible entryways. These circuits can produce interesting yield vector from every info vector, and the other way around, that is there is a coordinated mapping between the data and yield vectors. Case in point, a solitary reversible circuit for changing over a BCD to overabundance 3 code can change over a BCD to abundance 3 code and an abundance 3 code to BCD code while in advanced frameworks one would require two unique circuits for such a transformation.[1].
Reversible rationale circuits have hypothetically zero inside force dissemination in light of the fact that they don't lose data. Consequently,. In 1973,
Bennett demonstrated that with a specific end goal to stay away from KTln2 joules of vitality scattering in a circuit, it must be constructed utilizing reversible rationale gates[3].
With the little and powerful transistor at their hands, electrical
A Reversible gate is a k-input, k-output circuit that produces unique output for each possible input. Reversible gates [1] are circuits in which the number of input is equal to the number of output and there is one to one correspondence between the vector of inputs and outputs.
Definition 2.2
The unused output of a reversible gate is known as Garbage output. More it known also, the outputs, which are needed only to maintain reversibility, are called garbage outputs.[1]
Definition 2.3

The simple and basis Reversible gate is conventional NOT gate and is a 1*1 gate. The block diagram is given in Figure1.
The cost of Reversible NOT gate is 1.
Number of constant input, Total quantum cost and Total logical calculations.[5-6]. There is a number of reversible logic gates where we use only five kinds of them (FG, F2G,
NFT, NG and HNG gates) which are describe as below:
It is also known as controlled NOT (1-CNOT) and is the most suitable gate for single copy of bit therefore it is not producing any garbage output. It is shown in Fig. 1 and Fig. 2
[5]. Fig 1. Reversible NOT gate
Definition 2.4
The block diagram for 2*2 Feynman gate, also known as
Controlled NOT gate. This gate is one through because it passes one of its inputs. Every linear reversible function can be built by using only 2 * 2 inverters. Since this is a 2 * 2 gate, the cost is 1. The quantum circuit of Feynman gate is shown in Figure 2. The reasons to use this gate in reversible circuits are:
(i) Make the copy of an input (by putting any of the input a constant 0);
(ii) To invert an input bit (by putting any of the input a constant 1).
Fig 3. Feynman gate
Fig 4. Feynman gate as coping
The Feynman double gate is Feynman gate which having extra input and one more output with the control input ‘A’ is define the second controlled NOT operation which shown in fig.3.[6]
Fig 2: Quantum equivalent of Feynman gate
This section the basics and simple of reversible logic gates and various reversible logic gates introduce. Reversible rationale has gotten huge consideration lately. It has applications in different exploration territories, for example, low power CMOS outline. It is impractical to build quantum circuits without reversible rationale entryways. Union of reversible rationale circuits is altogether more entangled than conventional irreversible rationale circuits on the grounds that in a reversible rationale circuit, we are not permitted to utilize fan-out and criticism[3].
A circuit is reversible if and only if there is a one-to-one correspondence between its input and Output vector. The reversible gate having no of output and input. From the point of view of reversible circuit design, some of the main measures in designing an efficient reversible logic circuit are:
Number of reversible gates , Number of garbage outputs ,
Fig 5. Feynman Double Gate
A new gate having 3-input and 3-output which is shown in below figure.

Fig 6. New Gate
The 3-input and 3-output gate is also known as New fault tolerant gate. It can implement all Boolean function. New
Fault Tolerant Gate is shown in figure.[6]
Fig 7. New Fault Tolerant Gate
This is 4-input and 4-output reversible logic gate, which is used for full adder. The HNG is show in following figure.[6] correspond to a variety of different symbols, letter or instruction.
The reflected parallel code otherwise called dim code after blunt dim is a paired numeral framework where two progressive qualities contrast in standout bit. The reflected paired code was initially intended to keep spurious yield from electro mechanically switches, today dim codes are generally used to encourage mistake adjustment in advanced correspondence such s computerized physical TV.
In BCD code, we utilize the paired arrangement of numbers specifically. Initially, we can register weight or estimation of every bit of BCD code as per their areas which there weight are put away in 8 4 2 1 requests. Case in point, as a decimal number we pick 395 which it is spoken to 0011110010101 in
BCD form and every four bits demonstrate one and only digit in decimal.
:
Here we display our usage of reversible Aiken to BCD code converter utilizing TG and NFT entryways. As per the proposed reversible outline, as "An" information is created specifically in yield and with no operation, we exchange it to yield by control line. With a specific end goal to change over
Aiken code to BCD code, we have the accompanying mathematical statement of yield:
A= a
B= b+d
C= c’d+cb’
D= bc
Architecture for reversible Aiken to BCD code converter circuit:
Fig 8. Haghparast Navi Gate (HNG)
Binary codes represent text or computer processor instruction using the binary number system’s two binary digits, 0 & 1. A binary code assigns a bit string to eight binary digits can represent any 256 possible values and can therefore

Fig. Architecture of Aiken to BCD code converter
:
Here we demonstrate one current and a few reversible proposed BCD to Excess-3 code converter circuits that by contrasting our plans and the current circuit we can presume that our last plan is the best one among the others, Since it has the least quantum cost. Mathematical statement of this reversible converter is demonstrated as follows:
P=D’
Q=CD+C’D’
R=B’C+B’D+BC’D’
W=A+BC+BD
This paper has presented and proposed reversible rationale doors and reversible circuits for acknowledging distinctive code converters like BCD to Excess-3, Excess-3 to BCD,
Binary to Gray and Gray to Binary utilizing reversible rationale entryways. The proposed design leads to the reduction of power consumption compared with conventional logic circuits, the design proposed is implemented with FG and URG gates only in near future with the invent of new
RLG the power consumption may reduced to little more greater extent, not only that there will be a chance of implementing different logic circuits using reversible logic gates and which intern helps to increase the energy efficiency to a greater extent.
[1] Manjula Gandhi S, J Devishree “Design of Reversible
Code Converters for Quantum Computer based system” proceedings published by International Journal of Computer
Applications.
[2] Generation in computational process, IBM J. Research and Development,5: 183-191.
[3] Bennet, C.H.,1973.Logical Reversibility of Computation,
IBM J Research and Development ,pp: 525-532.
[4] Haghparast, M. and K. Navi, 2008. Design of a Novel
Fault Tolerant Reversible Full Adder For Nanotechnology
Based Systems, World Applied Science Journal3(1): 144-188.
[5] Haghparast, M. and K. Navi, 2008. A Novel Reversible
BCD Adder For Nanotechnology Based Systems, American J
Appl.sci5(3):282-288
[6] Haghparast, M. and K. Navi, 2008. A Novel Fault
Tolerant Reversible Gate For Nanotechnology Based Systems
American J.Appl. Sci.,5(5):519-523.
[7] Nielsen, M. A.,& Chuang, I. L. 2010. Quntum
Computation and quantum information. Cambridge university press.
[8] Perkowski, M. 2000. Reversible Computation for
Beginners.Lecture Series.
[9] Yelekar R. P, Shiwande. S S ,2011, Introduction to
Reversible Logic gates And its Application, 2 nd National
Conference on Information and Communication Technology, pp 5-9.
[10] James, R. K., Shahana, T. K., Jacob, K. P., & Sasi, S.
2007, November. A new look at reversible logic implementation of decimal adder. In system on chip, 2007
International symposium on (pp. 1-4).IEEE.
[11] Chinmaye, R., & Kn, M. 2012 Design, Optimization and
Synthesis of Efficient reversible Logic Binary Decoder.
International Journal of Computer Applications,46(6),45-51.
[12] Majib Haghparast, Maryam Hajizadeh, Rogayye
Hajizadeh “On the Syntesis of Different Nanometric
Reversible Converters”,Middle-East Journal of Scientific
Research 7 (5): 715-720,2011,ISSN 1990-9233,pp.715-720.