Fig 3 - uploaded by Prasanth Chaluvadi
Content may be subject to copyright.
Reversible Full Adder 3.2. Reversible Ripple Carry Adder It is possible to design logic to add n-bits by using multiple full adders where Cin of each full adder is Cout of previous full adder. Since in this logic circuit the carry ripples from first stage to last stage it is called as RCA. In order to design RRCA this paper cascades RFA, since this paper uses 2-bit RRCA it cascades two RFA.Fig 5 explains detail architecture of 2 bit Reversible RCA. 

Reversible Full Adder 3.2. Reversible Ripple Carry Adder It is possible to design logic to add n-bits by using multiple full adders where Cin of each full adder is Cout of previous full adder. Since in this logic circuit the carry ripples from first stage to last stage it is called as RCA. In order to design RRCA this paper cascades RFA, since this paper uses 2-bit RRCA it cascades two RFA.Fig 5 explains detail architecture of 2 bit Reversible RCA. 

Similar publications

Research Proposal
Full-text available
The proposed application ONLINE ELECTRICITY BILLING SYSTEM is aimed to develop a web application for the various activities being carried out by the BESCOM. The BESCOM is managed by the BESCOM officers who are supposed to get all the required information which are needed to generate an electricity bill for customers for their usage of electricity.
Article
Full-text available