An Ease implementation of 4-bit Arithmetic Circuit for 8 Operation by using a new reversible COG gate



Similar documents
A New Reversible TSG Gate and Its Application For Designing Efficient Adder Circuits

A Beginning in the Reversible Logic Synthesis of Sequential Circuits

An Extension to DNA Based Fredkin Gate Circuits: Design of Reversible Sequential Circuits using Fredkin Gates

AN IMPROVED DESIGN OF REVERSIBLE BINARY TO BINARY CODED DECIMAL CONVERTER FOR BINARY CODED DECIMAL MULTIPLICATION

COMPARATIVE ANALYSIS OF 4-BIT AND 8-BIT REVERSIBLE BARREL SHIFTER DESIGNS USING REVKIT

Keywords Quantum logic gates, Quantum computing, Logic gate, Quantum computer

International Journal of Electronics and Computer Science Engineering 1482

Let s put together a Manual Processor

NEW adder cells are useful for designing larger circuits despite increase in transistor count by four per cell.

COMBINATIONAL and SEQUENTIAL LOGIC CIRCUITS Hardware implementation and software design

Chapter 2 Logic Gates and Introduction to Computer Architecture

Design of Energy Efficient Low Power Full Adder using Supply Voltage Gating

Programming Logic controllers

CSE140 Homework #7 - Solution

Chapter 4 Register Transfer and Microoperations. Section 4.1 Register Transfer Language

10 BIT s Current Mode Pipelined ADC

Systems I: Computer Organization and Architecture

Binary Adders: Half Adders and Full Adders

DEPARTMENT OF INFORMATION TECHNLOGY

Optimization and Comparison of 4-Stage Inverter, 2-i/p NAND Gate, 2-i/p NOR Gate Driving Standard Load By Using Logical Effort

COMBINATIONAL CIRCUITS

1. True or False? A voltage level in the range 0 to 2 volts is interpreted as a binary 1.

A Novel Low Power, High Speed 14 Transistor CMOS Full Adder Cell with 50% Improvement in Threshold Loss Problem

Efficient Interconnect Design with Novel Repeater Insertion for Low Power Applications

ONLINE TESTING IN TERNARY REVERSIBLE LOGIC

Design of Reversible Random Access Memory

INTEGRATED CIRCUITS. For a complete data sheet, please also download:

(Refer Slide Time: 00:01:16 min)

5 Combinatorial Components. 5.0 Full adder. Full subtractor

ECE410 Design Project Spring 2008 Design and Characterization of a CMOS 8-bit Microprocessor Data Path

HIGH SPEED AREA EFFICIENT 1-BIT HYBRID FULL ADDER

FPGA Implementation of an Advanced Traffic Light Controller using Verilog HDL

Design of Low Power One-Bit Hybrid-CMOS Full Adder Cells

Two's Complement Adder/Subtractor Lab L03

Digital Logic Design. Basics Combinational Circuits Sequential Circuits. Pu-Jen Cheng

Microprocessor & Assembly Language

ELEC EXPERIMENT 1 Basic Digital Logic Circuits

CMOS Binary Full Adder

MICROPROCESSOR AND MICROCOMPUTER BASICS

Gates, Circuits, and Boolean Algebra

Implementation of Modified Booth Algorithm (Radix 4) and its Comparison with Booth Algorithm (Radix-2)

Module 3: Floyd, Digital Fundamental

Combinational Logic Design

FORDHAM UNIVERSITY CISC Dept. of Computer and Info. Science Spring, Lab 2. The Full-Adder

INSTITUTE OF AERONAUTICAL ENGINEERING Dundigal, Hyderabad

Basic Logic Gates Richard E. Haskell

Digital Electronics Detailed Outline

ISSCC 2003 / SESSION 13 / 40Gb/s COMMUNICATION ICS / PAPER 13.7

Design and Development of Virtual Instrument (VI) Modules for an Introductory Digital Logic Course

EXPERIMENT 4. Parallel Adders, Subtractors, and Complementors

CHAPTER 11: Flip Flops

Two-Phase Clocking Scheme for Low-Power and High- Speed VLSI

3.Basic Gate Combinations

Static-Noise-Margin Analysis of Conventional 6T SRAM Cell at 45nm Technology

MULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question.

Computer System: User s View. Computer System Components: High Level View. Input. Output. Computer. Computer System: Motherboard Level

A New Low Power Dynamic Full Adder Cell Based on Majority Function

Mixed Logic A B A B. 1. Ignore all bubbles on logic gates and inverters. This means

CHAPTER 3 Boolean Algebra and Digital Logic

ANALOG & DIGITAL ELECTRONICS

Associate Professor, Department of CSE, Shri Vishnu Engineering College for Women, Andhra Pradesh, India 2

RAM & ROM Based Digital Design. ECE 152A Winter 2012

Design and FPGA Implementation of a Novel Square Root Evaluator based on Vedic Mathematics

ASYNCHRONOUS COUNTERS

Sistemas Digitais I LESI - 2º ano

Floating Point Fused Add-Subtract and Fused Dot-Product Units

PROGRAMMABLE LOGIC CONTROLLERS Unit code: A/601/1625 QCF level: 4 Credit value: 15 TUTORIAL OUTCOME 2 Part 1

Study on Differential Protection of Transmission Line Using Wireless Communication

Contents COUNTER. Unit III- Counters

An Efficient RNS to Binary Converter Using the Moduli Set {2n + 1, 2n, 2n 1}

Lecture 8: Synchronous Digital Systems

ON SUITABILITY OF FPGA BASED EVOLVABLE HARDWARE SYSTEMS TO INTEGRATE RECONFIGURABLE CIRCUITS WITH HOST PROCESSING UNIT

SIMULATION OF CLOSED LOOP CONTROLLED BRIDGELESS PFC BOOST CONVERTER

ISSN: ISO 9001:2008 Certified International Journal of Engineering Science and Innovative Technology (IJESIT) Volume 2, Issue 3, May 2013

Flip-Flops, Registers, Counters, and a Simple Processor

FACULTY OF COMPUTER SCIENCE AND ENGINEERING CURRICULUM FOR POSTGRADUATE PROGRAMMES. (Master in Information Technology)

EE 42/100 Lecture 24: Latches and Flip Flops. Rev B 4/21/2010 (2:04 PM) Prof. Ali M. Niknejad

Logic in Computer Science: Logic Gates

CS101 Lecture 26: Low Level Programming. John Magee 30 July 2013 Some material copyright Jones and Bartlett. Overview/Questions

Department of CSE. Jaypee University of Information Technology, Waknaghat. Course Curricula

CHAPTER 7: The CPU and Memory

An Effective Deterministic BIST Scheme for Shifter/Accumulator Pairs in Datapaths

SEQUENTIAL CIRCUITS. Block diagram. Flip Flop. S-R Flip Flop. Block Diagram. Circuit Diagram

AUTOMATIC NIGHT LAMP WITH MORNING ALARM USING MICROPROCESSOR

Gates & Boolean Algebra. Boolean Operators. Combinational Logic. Introduction

CSCI 4717 Computer Architecture. Function. Data Storage. Data Processing. Data movement to a peripheral. Data Movement

Parametric variation analysis of CUK converter for constant voltage applications

Understanding Logic Design

4-bit binary full adder with fast carry CIN + (A1 + B1) + 2(A2 + B2) + 4(A3 + B3) + 8(A4 + B4) = = S1 + 2S2 + 4S3 + 8S4 + 16COUT

6-BIT UNIVERSAL UP/DOWN COUNTER

Control of a Three Phase Induction Motor using Single Phase Supply

Gates. J. Robert Jump Department of Electrical And Computer Engineering Rice University Houston, TX 77251

Lecture #21 April 2, 2004 Relays and Adder/Subtractors

Adder.PPT(10/1/2009) 5.1. Lecture 13. Adder Circuits

SIM-PL: Software for teaching computer hardware at secondary schools in the Netherlands

A MULTILEVEL INVERTER FOR SYNCHRONIZING THE GRID WITH RENEWABLE ENERGY SOURCES BY IMPLEMENTING BATTERY CUM DC-DC CONERTER

MICROPROCESSOR. Exclusive for IACE Students iacehyd.blogspot.in Ph: /422 Page 1

Transcription:

An Ease implementation of 4-bit Arithmetic Circuit for 8 Operation by using a new reversible COG gate Shefali Mamataj 1, Biswajit Das 2, Anurima Rahaman 3 Assistant Professor, Department of ECE, Murshidabad College of Engineering &Technology, Berhampore,India 1 Assistant Professor, Department of CSE, Murshidabad College of Engineering &Technology, Berhampore,India 2 B.Tech Student, Department of AEIE, Future Institute of Engineering and Management, Sonarpur, India 3 ABSTRACT: Reversible logic is one of the most important issues at present time and it has different areas for its application. The main purposes of designing reversible logic are to decrease quantum cost, depth of the circuits and the number of garbage outputs. A new reversible gate COG is proposed in this paper. This paper also represents an ease implementation of 4 bit arithmetic circuit for 8 operation by using the reversible COG gate. Keywords: Reversible logic, Basic Reversible Gates, Full adder, Arithmetic Operation,Garbage, Quantum cost. I. INTRODUCTION Energy dissipation is one of the most important factors in electrical circuit designing. Reversible logic was first related to energy when Landauer states that information loss due to function irreversibility leads to energy dissipation in 1961 who stated that there is small amount of heat dissipation the circuit due to loss of one bit of information and it would be equal to ktln2 where k is Boltzman constant and T is the temperature [1]. This principle is further supported by Bennett that zero energy dissipation can be achieved only when the circuit contains reversible gates in 1973.It was proved by Bennett that the energy ktln2 would not be dissipate from the circuit if input can be extracted from output and it would be possible if and only if reversible gates are used[2]. According to Moore s law the numbers of transistors will double every 18 months. Thus energy conservative devices are the need of the day. The amount of energy dissipated in a system bears a direct relationship to the number of bits erased during computation. Reversible circuits are those circuits that do not lose information A circuit will be reversible if input vector can be specifically retrieved from output vectors and here is one to one correspondence between input and output [3]. Younis and Knight [4] showed that some reversible circuits can be made asymptotically energy-lossless if their delay is allowed to be arbitrarily large. A reversible logic circuit should have the following features [6]: Use minimum number of reversible gates. Use minimum number of garbage outputs. Use minimum constant inputs. II. LITERATURE SURVEY Landauer, Rolf. [1]." Irreversibility and Heat Generation in the Computing Process". R Landauer s showed, amount of heat generation due to loss of bit is ktlog2, and this value is approx 2.8*10-21 joule, which is small but not negligible. Bennett, Charles H [2]. "Logical Reversibility of Computation". Bennett showed that this heat dissipation due to information loss can be avoided if the circuit is designed using reversible logic gates. No amount of heat would be dissipated from the system as long as the system was able to return to its initial state from its final state. E.Fredkin, T Toffoli, Peres [9] [10] [12] proposed reversible logic gates..in Optimal Design of a Reversible Full Adder [18] Yvan Van Rentergem and Alexis De Vos presented four designs for Reversible full-adder circuits and the implementation of these logic circuits into electronic circuitry based on CMOS technology and pass-transistor design. In A General Method of Constructing the Reversible Full-Adder [19] Lihui Ni, Zhijin Guan, and Wenying Zhu described general approach to construct the Reversible full adder and can be extended to a variety of Reversible full adders with only two Reversible gates. In Efficient adder circuits based on a conservative reversible logic gate,[20] Bruce, J.W., M.A. Thornton, L. shivakuamaraiah, P.S. kokate and X. Li, used only Fredkin gates to construct full adder with gates cost Copyright to IJAREEIE www.ijareeie.com 6911

equal to 4, 3 garbage outputs and 2 constant input. In An Arithmetic Logic Unit Design Based on Reversible Logic Gates [5] Zhijin Guan, Wenjuan Li, Weiping Ding, Yueqin Hang, Lihui Ni. Proposed a method for using the reversible logic gates as logic devices to structure the reversible ALU. In Design and Analysis of 16 bit reversible ALU. Lekshmi Viswanath, Ponni.M [17], presented that circuit designed using reversible logic has reduce delay and power III. RELATED WORK A. Reversible logic Function It is an n-input n-output logic function in which there is a one-to-one correspondence between the inputs and the outputs. Because of this bijective mapping the input vector can be uniquely determined from the output vector. This prevents the loss of information which is the root cause of power dissipation in irreversible logic circuits. The reversible logic circuits must be constructed under two main constraints. They are Fan-out is not permitted. Loops or feedbacks are not permitted The quantum cost(qc) of any reversible gate(circuit) is the number of 1 1 or 2 2 reversible gates and quantum logic gates such as V, V+ (V is also named square root of NOT gate NOT and V+ is hermitian of V). The V and V+ quantum gates have some properties that are shown in Equation (1) (Mohammadi et al., 2009). V V = NOT V V+= V+ V = I Equation (1) V+ V+ = NOT Any reversible logic gate (circuit) is realized by using mentioned gates above, NOT and FG gates. The properties above show that when two V gates are in series they will behave as a NOT gate. Similarly, two V + gates in series also function as a NOT gate. A V gate in series with V + gate, and vice versa, is an identity. B. Reversible logic Gates The important basic reversible logic gates are, Feynman gate [7] which is the only 2*2 reversible gate which is as shown in the figure.1a and it is used most popularly by the designers for fan-out purposes. There is also a double Feynman gate [8], Fredkin gate [9] and Toffoli gate [10],New Gate[11], Peres gate[12], all of which can be used to realize important combinational functions and all are 3*3 reversible gates and are as shown in the figure.1b to figure.1e.the figures also shows the switching functions for terminals Fig.1a Feynman gate 2*2 gate Fig.1b Fredkin gate 3*3 gate Fig.1c Toffoli gate 3 * 3 gate Fig.1d New gate 3 * 3 gate Fig.1e. Peres gate 3 * 3 gate IV. A 4X4 DKFG REVERSIBLE GATE A 4 * 4 reversible gate DKFG already had been proposed [13] shown in figure 2. In this gate the input vector is given by = (0, A,, C) and the corresponding output vector is = (,,, ). Copyright to IJAREEIE www.ijareeie.com 6912

Figure 2: DKFG Gate We can implement half-adder by using DKFG gate as shown in fig 2a.We can use DKFG gate as a full-adder as shown in fig2b Figure2a. Implementation of DKFG gate as a half-adder Figure 2b. Implementation of DKFG gate as a full-adder V. A NEW PROPOSED 3X3 REVERSIBLE GATE A 3X3 reversible gate COG (Controlled Operation Gate) logic has been proposed in this paper (See Figure 3). The Truth table for the corresponding gate is shown in figure 3 also.the A closer look at the Truth Table reveals that the input pattern corresponding to a specific output pattern can be uniquely determined and thereby maintaining that there is a one-to-one correspondence between the input vector and the output vector. In this gate the input vector is given by = (A,, C) and the corresponding output vector is = (,, ) INPUTS OUTPUTS A B C P Q R 0 0 0 0 0 1 0 0 1 0 0 0 0 1 0 0 1 0 0 1 1 0 1 1 1 0 0 1 0 1 1 0 1 1 1 0 1 1 0 1 0 0 1 1 1 1 1 1 Figure 3. Proposed COG reversible gate and its truth table VI. DESIGN OF ARITHMETIC CIRCUIT ALU is a data processing component, which is an important part in centre process unit (CPU). Different kinds of computers have different ALUs. But all of the ALUs contain arithmetic unit and logic unit, which are the basic structures. The basic component of the arithmetic section of an ALU is a parallel adder. A parallel adder is constructed with a number of full adder circuits connected in cascade. By controlling the data inputs to the parallel adder, it is possible to obtain different types of arithmetic operations. Figure 4 shows the arithmetic operations obtained when one set of inputs to a parallel adder is controlled externally. Copyright to IJAREEIE www.ijareeie.com 6913

The number of bits in the parallel adder may be of any value. The input carry C in goes to the full adder circuit in the least significant bit position and the C out comes from the full adder circuit in the most significant bit position. From the figure 4(a) to 4(h) we can see various type of eight operations can be achieved by controlling the B input and C in.so to design the circuit we need two parts, one is control circuit and the another one is full adder. Figure 4. Eight operations obtained by controlling one set of inputs to a parallel adder VII. CONVENTIONAL LOGIC DIAGRAM OF 4 BIT ARITHMETIC CIRCUIT The conventional logic diagram of4 bit arithmetic circuit is shown in figure5.the circuit that controls the input B to provide various type of operation shown in figure4 consists of two NAND gates, one OR gate and one NOT gate. The circuit is called a true/complement, one/zero element. There are two selection lines S 1 and S 0 to control the B input. When S 1 S 0 =00 the output of the OR gate Y=0, When S 1 S 0 =01 the output of the OR gate Y=B, When S 1 S 0 =10 the output of the OR gate Y=B and When S 1 S 0 =11 the output of the OR gate Y=B+B =1 Figure 5. Logic diagram of 4 bit Arithmetic circuit for Eight operations Copyright to IJAREEIE www.ijareeie.com 6914

From the figure 5we can see that the parallel adder constitutes of four full adder.the carry into the first stage is the input carry. The carry out of the fourth stage is the output carry. The selection variables are S 1,S 0 and C in. Variables S 1 S 0 control all the B inputs to the full adder circuits. The A inputs go directly to the other inputs of the full adder. The arithmetic circuit operation is given below in table 1. TABLE I:Function Table for the Arithmetic circuit Function select Y equals Output equals Function S1 S0 C in 0 0 0 0 F=A Transfer A 0 0 1 0 F=A+1 Increment A 0 1 0 B F=A+B Add B to A 0 1 1 B F=A+B+1 Add B to A plus 1 1 0 0 B F=A+B Add 1 s complement of B to A 1 0 1 B F=A+B +1 Add 2 s complement of B to A 1 1 0 All 1 s F=A-1 Decrement A 1 1 1 All 1 s F=A Transfer A VII. IMPLEMENTATION OF 4 BIT ARITHMETIC CIRCUIT BY REVERSIBLE GATE We can implement one bit arithmetic logic unit by using the proposed reversible COG gate as a control unit shown in fig 6..From the truth tables of COG gate [Figure3] we can see that the input B can be controlled depending upon the value of S 1 and S 0. Figure 6. Proposed COG reversible gate as a control unit We can now implement the four bit arithmetic circuit for eight operations by cascading this four one bit arithmetic circuit shown in figure 7. But here DKFG reversible gate has been used as a full adder. So we need four DKFG reversible gates for constructing parallel adder.f 3 F 2 F 1 F 0 represents output functions. Copyright to IJAREEIE www.ijareeie.com 6915

Figure 7. Proposed 4 bit arithmetic circuit for 8 operation by reversible gate COG as a control unit & DKFG reversible gate as full adder TABLE II COMPARISON OF EXISTING 1 BIT ALU AND CONTROL UNIT TO THE PROPOSED ONE Parameter Which has to be compared Existing 1 bit ALU[14] 1 bit ALU Control unit Existing 1 bit ALU[15] Proposed 1 bit ALU Existing control unit[14] Existing control unit[15] Proposed control unit Gate count 22 10 2 15 9 1 Garbage output 12 8 4 8 6 2 Constant input 10 4 4 8 3 3 VIII.CONCLUSION In this paper, arithmetic unit using reversible control unit COG has been proposed. We have compared these proposed design with the existing designs [14,16] in terms of reversible gates used, Garbage outputs, constant inputs, & arithmetic functions. Arithmetic reversible control unit has also great improvement over existing designs [14, 15]. So the proposed design implementation of reversible ALU in terms of number of gates used, Garbage outputs and constants input can be used for low power applications. In future we can design complete reversible computer architecture with the help of proposed designs. The reversible ALU will be a central unit in a future design of a fully reversible architecture using only reversible logic elements. For a complete architecture, more key elements must be designed including a reversible control unit and a new approach to reversible memory. REFERENCES [1] R.Landauer,-Irreversibility and Heat Generation in the Computational Process, IBM Journal of Research and Development, 5, pp. 183-191, 1961. [2] C.H. Bennett, Logical Reversibility of Computation, IBM J.Research and Development, pp. 525-532, November 1973. [3] Pradeep singla and Naveen kr. Malik A Cost - Effective Design of Reversible programmable logic array International Journal Of Computer Application, volume 41 no. 15, march- 2012. [4] S.Younis and T. Knight, Asymptotically Zero Energy Split-Level Charge Recovery Logic, Workshop on Low Power Design, June1994 Copyright to IJAREEIE www.ijareeie.com 6916

[5] Zhijin Guan, Wenjuan Li, Weiping Ding, Yueqin Hang, Lihui Ni An Arithmetic Logic Unit design based on reversible logic gates IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PacRim), 2011 [6]. Perkowski, M. and P. Kerntopf, Reversible Logic. Invited tutorial Proc. EURO-MICRO, Warsaw, Poland,Sept 2001 [7] R. Feynman, Quantum Mechanical Computers,Optical News, pp. 11-20, 1985 [8] B. Parhami; Fault Tolerant Reversible Circuits Proc. 40th Asilomar Conf. Signals, Systems, and Computers, Pacific Grove,CA, Oct.2006 [9] E. Fredkin, T. Toffoli, Conservative Logic,International Journal of Theor. Physics, 21, pp.219-253, 1982. [10] T. Toffoli., Reversible Computing, Tech memo MIT/LCS/TM 151,MIT Lab for Computer Science (1980). [11] Md. M. H Azad Khan, Design of Full-adder With Reversible Gates, International Conference on Computerand Information Technology, Dhaka, Bangladesh,pp.515-519,2002 [12] Peres, A.. Reversible logic and quantum computers, Physical Review: A, 32 (6): 3266-3276, 1985 [13] Shefali Mamataj 1,Biswajit Das 2, Anurima Rahaman 3 An Approach for Realization of 2 s Complement Adder Subtractor Using DKG Reversible gate, International Journal of Emerging Technology and Advanced Engineering: Volume 3, Issue 12, December 2013) [14] Zhijin Guan,Wenjuan Li,Weiping Ding,Yueqin Hang,and Lihui Ni, An Arithmetic Logic Unit Design Based on Reversible Logic Gates,Communic tions,computers and Signal Processing (PacRim)v, pp.925-931, 03 October 2011 [15] Akanksha Dixit, Vinod Kapse,Arithmetic & Logic Unit (ALU) Design using Reversible Control Unit International Journal of Engineering and Innovative Technology (IJEIT) Volume 1, Issue 6, June 2012 [16] Y. Syamala, and A. V. N. Tilak, Reversible Arithmetic Logic Unit, Electronics Computer Technology (ICECT), 2011 3rd International, vol. 5, pp.207-211,07 july 2011. [17] LekshmiViswanath,Ponni.M Design and analysis of 16 bit reversible ALU, IOSR Journal of Computer Engineering (IOSRJCE) ISSN : 2278-0661 Volume 1, Issue 1, PP 46-53, (May-June) 2012 [18] Yvan Van Rentergem and Alexis De Vos, Optimal Design of a Reversible Full Adder, International Journal of Unconventional Computing, vol. 1, pp. 339 355, 2005 [19] Lihui Ni, Zhijin Guan, and Wenying Zhu,A General Method of Constructing the Reversible Full-Adder, Third International Symposium on Intelligent Information Technology and Security Informatics, pp.109-113, 2010 [20] Bruce, J.W., M.A. Thornton, L. shivakuamaraiah, P.S. kokate and X. Li-Efficient adder circuits based on a conservative reversible logic gate, IEEE computer society Annual symposium on VLSI, Pittsburgh, Pennsylvania, and pp: 83-88, 2000 Copyright to IJAREEIE www.ijareeie.com 6917