Online Testable Fault Tolerant Full Adder in Reversible Logic Synthesis Sajib Kumar Mitra MS/2008-09 Department of Computer Science and Engineering University.

Slides:



Advertisements
Similar presentations
ADDER, HALF ADDER & FULL ADDER
Advertisements

Digital Circuits. Review – Getting the truth table The first step in designing a digital circuit usually is to get the truth table. That is, for every.
Synthesis of Reversible Synchronous Counters Mozammel H A Khan Department of Computer Science and Engineering, East West University, 43 Mohakhali, Dhaka.
Combinational Circuits
1 Combinational Logic Design&Analysis. 2 Introduction We have learned all the prerequisite material: – Truth tables and Boolean expressions describe functions.
Self-Checking Carry-Select Adder Design Based on Two-Rail Encoding
Marek Perkowski Reversible Logic Models: Billiard Ball and Optical Lecture 4.
Derivatives of Perkowski’s Gate k f2 g h t t De Vos gates  f1f1  A B P Q Feynman gates A B P f 2f 2  C Q R Toffoli gates Q P f 2 A C R B S D 0.
Lecture 14 Today we will Learn how to implement mathematical logical functions using logic gate circuitry, using Sum-of-products formulation NAND-NAND.
Introduction to Quantum Logic 2002/10/08 Tuesday Jung-wook Kim.
Combinational circuits
Lecture 3. Boolean Algebra, Logic Gates
Propositional Calculus Math Foundations of Computer Science.
Lecture 3. Boolean Algebra, Logic Gates Prof. Sin-Min Lee Department of Computer Science 2x.
EE694v-Verification-Lect11-1- Lect 35 – Verification Project 2 Design of fault tolerant circuit testing and fault simulation. What needs verified –A SEC/DED.
Systems Architecture I1 Propositional Calculus Objective: To provide students with the concepts and techniques from propositional calculus so that they.
REVERSIBLE LOGIC SYNTHESIS. Overview of the Presentation 1. Introduction 2. Design of a Reversible Full-adder Circuit.
Eng. Mohammed Timraz Electronics & Communication Engineer University of Palestine Faculty of Engineering and Urban planning Software Engineering Department.
Chapter 10 (Part 2): Boolean Algebra  Logic Gates (10.3) (cont.)  Minimization of Circuits (10.4)
1 Boolean Algebra & Logic Gates. 2 Objectives Understand the relationship between Boolean logic and digital computer circuits. Learn how to design simple.
Module 9.  Digital logic circuits can be categorized based on the nature of their inputs either: Combinational logic circuit It consists of logic gates.
Important Components, Blocks and Methodologies. To remember 1.EXORS 2.Counters and Generalized Counters 3.State Machines (Moore, Mealy, Rabin-Scott) 4.Controllers.
1/14 Synthesis and Design of Parameter Extractors for Low-Power Pre-computation-Based Content-addressable Memory Using Gate- Block Selection Algorithm.
Design of an 8-bit Carry-Skip Adder Using Reversible Gates Vinothini Velusamy, Advisor: Prof. Xingguo Xiong Department of Electrical Engineering, University.
ARITHMETIC MICRO OPERATIONS
Universal college of engineering & technology. .By Harsh Patel)
Design of a Reversible Binary Coded Decimal Adder by Using Reversible 4-bit Parallel Adder Babu, H. M. H. Chowdhury, A.R, “Design of a reversible binary.
1 Ethics of Computing MONT 113G, Spring 2012 Session 5 Binary Addition.
Digital Logic Structures: Chapter 3 COMP 2610 Dr. James Money COMP
Computer Architecture
R. Johnsonbaugh Discrete Mathematics 5 th edition, 2001 Chapter 9 Boolean Algebras and Combinatorial Circuits.
Combinational Circuits
Gates AND, OR, NOT NAND, NOR Combinational logic No memory A set of inputs uniquely and unambiguously specifies.
Quantum Cost Calculation of Reversible Circuit Sajib Mitra MS/ Department of Computer Science and Engineering University of Dhaka
Simple ALU  Half adder  Full adder  Constructing 4 bits adder  ALU does several operations  General ALU structure  Timing diagram of adder  Overflow.
How does a Computer Add ? Logic Gates within chips: AND Gate A B Output OR Gate A B Output A B A B
Logic Gates Chapter 5 Subject: Digital System Year: 2009.
WORKING PRINCIPLE OF DIGITAL LOGIC
C OMBINATIONAL L OGIC D ESIGN 1 Eng.Maha AlGubali.
Programming for GCSE Topic 9.2: Circuits for Adding T eaching L ondon C omputing William Marsh School of Electronic Engineering and Computer Science Queen.
BDD-based Synthesis of Reversible Logic for Large Functions Robert Wille Rolf Drechsler DAC’09 Presenter: Meng-yen Li.
A Synthesis Method for MVL Reversible Logic by 1 Department of Computer Science, University of Victoria, Canada M. Miller 1, G. Dueck 2, and D. Maslov.
Combinational Logic Circuits
Lecture 6: Universal Gates
Combinational Logic Circuits
Computer Architecture CST 250
KS4 Electricity – Electronic systems
KS4 Electricity – Electronic systems
Summary Half-Adder Basic rules of binary addition are performed by a half adder, which has two binary inputs (A and B) and two binary outputs (Carry out.
XOR, XNOR, and Binary Adders
Lecture 6: Universal Gates
XOR, XNOR, & Binary Adders
Week 7: Gates and Circuits: PART II
Digital Logic.
Number Systems and Circuits for Addition
Lecture 6: Universal Gates
KS4 Electricity – Electronic systems
Adders and Subtractors
DIGITAL ELECTRONICS B.SC FY
XOR, XNOR, and Binary Adders
Electronics for Physicists
Parity Generator and Checkers
XOR Function Logic Symbol  Description  Truth Table 
Prof. Onur Mutlu ETH Zurich Spring March 2019
Adder Circuits By: Asst Lec. Basma Nazar
Digital Circuits.
XOR, XNOR, and Binary Adders
Chapter 11 (Part 2): Boolean Algebra
Sajib Kumar Mitra, Lafifa Jamal and Hafiz Md. Hasan Babu*
Computer Architecture
Presentation transcript:

Online Testable Fault Tolerant Full Adder in Reversible Logic Synthesis Sajib Kumar Mitra MS/ Department of Computer Science and Engineering University of Dhaka

Overview Background Study  Reversible Logic  Fault Tolerant Method  Online Testability Online Testable Fault Tolerant Circuit Full Adder Circuit  Existing Design  Proposed Design Performance Analysis About Authors Conclusion

Reversible Logic Unique mapping between input and output vectors which governs to have same number of input-output lines of any reversible circuit Recovers heat dissipation unlikely irreversible logic and uses low power CMOS technology Feedback and Fan-out are not allowed Single unit able to compute more than one operation

Reversible Logic (cont…) An (n x n) Reversible Circuit

Reversible Logic (cont…) Unique mapping of Reversible Circuit O1O2O3...OnO1O2O3...On Output Vector I1I2I3...InI1I2I3...In Input Vector

Reversible Logic (cont…) An (n x n) Reversible Circuit Architecture

Reversible Logic (cont…) Reversible EX-OR operation and 2x2 Feynman Gate

Reversible Logic (cont…) Popular 3x3 Reversible Gates

Reversible Logic (cont…) 4x4 Reversible Gates

Reversibility prevents Bit Loss but not able to detect Bit Error or Fault in Circuit

Fault Tolerant Method Bit Error means the alteration of the value of output bits because of internal fault of digital circuit. InputOutput ABAA B What is the meaning of Bit Error? Bit Error in Reversible Circuit

Fault Tolerant Method (cont…) Bit Error means the alteration of the value of output bits because of internal fault of digital circuit. InputOutput ABAA B What is the meaning of Bit Error? Bit Error in Reversible Circuit

Fault Tolerant Method (cont…) Preserves same parity between Input and Output vectors over one to one mapping of reversible circuit Parity Preservation of Reversible Circuit

Fault Tolerant Method (cont…) Let, I v and O v are input and output vectors of a reversible circuit, so the relation is I v ↔O v. But to be a Reversible Fault Tolerant circuit, itself must preserve following equation: where I v ={ I 1, I 2, I 3, …, I n } and O v ={ O 1, O 2, O 3, …, O n } Input Parity = Output Parity

Fault Tolerant Method (cont…) Parity Preservation over reversibility between Input and Output vectors can be realized from the Truth Table of Fredkin Gate as shown below: Fredkin Gate and Corresponding Truth Table InputOutput ABCPQR

Fault Tolerant Method (cont…) InputOutput ABCPQR Fredkin Gate and Corresponding Truth Table Now Verify the following equation:

Fault Tolerant Method (cont…) Fault detection of FRG gate Verify the following equation: Fault exist in Circuit No Fault exist in Circuit

Fault Tolerant Method (cont…) But the minimum dimension of Fault Tolerant gates is 3. Why? Finally Reversible Gate which preserves same parity between input and output vectors is called Fault Tolerant Gate or Parity Preserving Gate InputOutput AA’ x1 Reversible Gate Never be a Fault Tolerant Gate NOT operation

Fault Tolerant Method (cont…) But the minimum dimension of Fault Tolerant gates is 3. Why? InputOutput ABPQ x2 Reversible Gates have no any significance as Fault Tolerant Gate InputOutput ABPQ InputOutput ABPQ InputOutput ABPQ

Fault Tolerant Method (cont…) Existing 3x3 and 4x4 Fault Tolerant Gates

Online Testability Built-In Self Testing method Detects bit-error at outputs of any circuit in run time Reversible gates able to adopt testability feature by deducing output and corresponding input bits To be online testable an ( n x n) reversible gates must preserve the following properties: where I v ={ I 1, I 2, I 3, …, I n } and O v ={ O 1, O 2, O 3, …, O n }

Online Testability (cont…) To be online testable an ( n x n) reversible gates must have the following properties: 3x3 F2G is not online Testable Gates But F2G can be Testable by deducing extra an input and corresponding output line.

Online Testability (cont…) To be online testable an ( n x n) reversible gates must have the following properties: Testing OutputTesting Input

Online Testability (cont…) Verification of Testable F2G at Runtime

Online Testability (cont…) Verification of Testable F2G at Runtime

Online Testability (cont…) Verification of Testable F2G at Runtime

Online Testability (cont…)

Operational Outputs Testing Outputs Testing Inputs (Constant Value) Operational Inputs TRC is a Cascading Block not Gate

Online Testability (cont…) Conversion of nxn Reversible Gate into (n+2)x(n+2) reversible Cell Testable R based on following Law: Testable Reversible Cell by using Cascading Attachment

Reversible Fault Tolerant Full Adder Circuit Full Adder circuit produces Sum and C out as following equations respectively: Full Adder can be realized by using only one MTSG gate as follows:

Reversible Fault Tolerant Full Adder Circuit (cont…) Pros o Garbage = 2 o Gate = 1 o Quantum Cost = 6 Cons Neither Fault Tolerant nor Online testable You have to make Fault Tolerant and Online Testable circuit by using fault Tolerant Gates. So start now…

Existing Fault Tolerant Fault Tolerant Adder Circuit By using MIG… Design is Fault tolerant but uses higher dimensional reversible Gates To make online testable, circuit has to increase an extra input-output line

Proposed Design of Fault Tolerant Full Adder Uses 3x3 Fault Tolerant gates Easily adoptable to online testable full adder Minimum number of Garbage, 3 Preferable for Carry Look Ahead adder

Proposed Design of Online Testable Fault Tolerant Full Adder

Performance Analysis Fault Tolerant Full Adder Total Gates Total Garbage Quantum Cost 3x34x4 Proposed [b]40311 Existing [a]02314 Table 1: Comparison between proposed and existing design

About Author Ahsan Raja Chowdhury received his B.Sc.and MS degrees in Computer science and Engineering from the University of Dhaka, Bangladesh, in 2004 and 2006, respectively. He worked with the Department of Computer Science and Engineering, Northern University, Bangladesh, from 2004 to 2007 as faculty member. He is the faculty member of the Department of Computer Science and Engineering, Sajib Kumar Mitra is an MS student of Dept. of Computer Science and Engineering, University of Dhaka, Dhaka, Bangladesh. His research interests include Electronics, Digital Circuit Design, Logic Design, and Reversible Logic Synthesis. Md. Faisal Hossain has completed his undergraduate from Dept. of Computer Science and Engineering, University of Dhaka, Dhaka, Bangladesh. His research interest includes Logic Design, especially Reversible Logic Design.

Thanks To All