Fault tolerant and online testability

1,104 views
981 views

Published on

0 Comments
0 Likes
Statistics
Notes
  • Be the first to comment

  • Be the first to like this

No Downloads
Views
Total views
1,104
On SlideShare
0
From Embeds
0
Number of Embeds
5
Actions
Shares
0
Downloads
52
Comments
0
Likes
0
Embeds 0
No embeds

No notes for slide

Fault tolerant and online testability

  1. 1. Fault Tolerant and OnlineTestability in Reversible Logic Synthesis Sajib Kumar MitraDepartment of Computer Science and Engineering University of Dhaka sajibmitra.csedu@yahoo.com
  2. 2. 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
  3. 3. 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
  4. 4. Reversible Logic (cont…) An (n x n) Reversible Circuit
  5. 5. Reversible Logic (cont…) I1 O1 I2 O2 I3 O3 . . . . . . In On Input Input Output Output Vector Vector Vector VectorUnique mapping of Reversible Circuit
  6. 6. Reversible Logic (cont…)An (n x n) Reversible Circuit Architecture
  7. 7. Reversible Logic (cont…)Reversible EX-OR operation and 2x2 Feynman Gate
  8. 8. Reversible Logic (cont…) Popular 3x3 Reversible Gates
  9. 9. Reversible Logic (cont…) 4x4 Reversible Gates
  10. 10. Reversibility prevents Bit Loss but not able to detect Bit Error or Fault in Circuit
  11. 11. Fault Tolerant MethodWhat is the meaning of Bit Error? Bit Error means the alteration of the value of output bits because of internal fault of digital circuit. Input Output A B A A B 0 0 0 0 0 1 0 1 1 0 1 1 1 1 1 0 Bit Error in Reversible Circuit
  12. 12. Fault Tolerant Method (cont…)What is the meaning of Bit Error? Bit Error means the alteration of the value of output bits because of internal fault of digital circuit. Input Output A B A A B 0 0 0 0 0 1 0 1 1 0 1 1 1 1 1 0 Bit Error in Reversible Circuit
  13. 13. 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
  14. 14. Fault Tolerant Method (cont…)Let, Iv and Ov are input and output vectors of a reversible circuit, so the relation is Iv↔Ov.But to be a Reversible Fault Tolerant circuit, itself must preserve following equation: I1 ⊕ I 2 ⊕ ⊕ I n = O1 ⊕ O2 ⊕ ⊕ Onwhere Iv={I1, I2, I3, …, In} and Ov={O1, O2, O3, …, On} Input Parity = Output Parity
  15. 15. 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: Input Output A B C P Q R 0 0 0 0 0 0 0 0 1 0 0 1 0 1 0 0 1 0 0 1 1 0 1 1 1 0 0 1 0 0 1 0 1 1 1 0 Fredkin Gate and 1 1 0 1 0 1 Corresponding Truth Table 1 1 1 1 1 1
  16. 16. Fault Tolerant Method (cont…)Now Verify the following equation: A ⊕ B ⊕C = P ⊕Q ⊕ R Input Output A B C P Q R 0 0 0 0 0 0 0 0 1 0 0 1 0 1 0 0 1 0 0 1 1 0 1 1 1 0 0 1 0 0 1 0 1 1 1 0 Fredkin Gate and 1 1 0 1 0 1 Corresponding Truth Table 1 1 1 1 1 1
  17. 17. Fault Tolerant Method (cont…)Verify the following equation: A ⊕ B ⊕C = P ⊕Q ⊕ R No Fault exist in Circuit Fault exist in Circuit Fault detection of FRG gate
  18. 18. Fault Tolerant Method (cont…)Finally Reversible Gate which preserves same parity between input and output vectors is called Fault Tolerant Gate or Parity Preserving Gate But the minimum dimension of Fault Tolerant gates is 3. Why? Input Output A A’ 0 1 NOT operation 1 0 1x1 Reversible Gate Never be a Fault Tolerant Gate
  19. 19. Fault Tolerant Method (cont…)But the minimum dimension of Fault Tolerant gates is 3. Why?Input Output Input Output Input Output Input OutputA B P Q A B P Q A B P Q A B P Q0 0 0 0 0 0 0 0 0 0 1 1 0 0 1 10 1 0 1 0 1 1 0 0 1 1 0 0 1 0 11 0 1 0 1 0 0 1 1 0 0 1 1 0 1 01 1 1 1 1 1 1 1 1 1 0 0 1 1 0 0 2x2 Reversible Gates have no any significance as Fault Tolerant Gate
  20. 20. Fault Tolerant Method (cont…) Existing 3x3 and 4x4 Fault Tolerant Gates
  21. 21. 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: On = I n ⊕ O1 ⊕ O2 ⊕ ⊕ On −1where Iv={I1, I2, I3, …, In} and Ov={O1, O2, O3, …, On}
  22. 22. Online Testability (cont…)To be online testable an (n x n) reversible gates must have the following properties: On = I n ⊕ O1 ⊕ O2 ⊕ ⊕ On −1 Let , O3 = C ⊕U ⊕V = C ⊕ A⊕ A⊕B = C ⊕B ∴O3 ≠ W 3x3 F2G is not online Testable GatesBut F2G can be Testable by deducing extra an input and corresponding output line.
  23. 23. Online Testability (cont…)To be online testable an (n x n) reversible gates must have the following properties: On = I n ⊕ O1 ⊕ O2 ⊕ ⊕ On −1 Let , Testing Input Testing Output O3 = P ⊕U ⊕V ⊕W = P ⊕ A ⊕ A ⊕ B ⊕ A ⊕C = P ⊕ A ⊕ B ⊕C ∴ O3 = Q
  24. 24. Online Testability (cont…) Let , O3 = P ⊕U ⊕V ⊕W = 0 ⊕1 ⊕1 ⊕1 = 1 ∴ O3 = QVerification of Testable F2G at Runtime
  25. 25. Online Testability (cont…) Let , O3 = P ⊕U ⊕V ⊕W = 0 ⊕1 ⊕1 ⊕ 0 = 0 ∴ O3 ≠ QVerification of Testable F2G at Runtime
  26. 26. Online Testability (cont…) Assignment : D =U E =V F =W R =0Verification of Testable F2G at Runtime
  27. 27. Online Testability (cont…) If Q = S then " NO Bit Error" else " Bit Error"
  28. 28. Online Testability (cont…)
  29. 29. Online Testability (cont…)Operational Inputs Operational Outputs Testing Inputs(Constant Value) Testing Outputs TRC is a Cascading Block not Gate
  30. 30. Online Testability (cont…) Testable R based on Testable Reversible Cell by following Law: using Cascading AttachmentOn = I n ⊕ O1 ⊕ O2 ⊕ ⊕ On −1 Conversion of nxn Reversible Gate into (n+2)x(n+2) reversible Cell
  31. 31. Reversible Fault Tolerant Full Adder Circuit• Full Adder circuit produces Sum and Cout as following equations respectively: Sum = A ⊕ B ⊕ Cin Cout = ( A ⊕ B )Cin ⊕ AB• Full Adder can be realized by using only one MTSG gate as follows:
  32. 32. 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…
  33. 33. Existing Fault Tolerant Fault Tolerant Adder CircuitBy 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
  34. 34. 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
  35. 35. Proposed Design of OnlineTestable Fault Tolerant Full Adder
  36. 36. Performance Analysis Table 1: Comparison between proposed and existing design Total GatesFault Tolerant Total Quantum Full Adder 3x3 4x4 Garbage CostProposed [b] 4 0 3 11 Existing [a] 0 2 3 14
  37. 37. About AuthorSajib Kumar Mitra is an MS student of Dept. of ComputerScience and Engineering, University of Dhaka, Dhaka,Bangladesh. His research interests include Electronics, DigitalCircuit Design, Logic Design, and Reversible Logic Synthesis.Md. Faisal Hossain has completed his undergraduate fromDept. of Computer Science and Engineering, University ofDhaka, Dhaka, Bangladesh. His research interest includesLogic Design, especially Reversible Logic Design. Ahsan Raja Chowdhury received his B.Sc .and MS degreesin Computer science and Engineering from the University ofDhaka, Bangladesh, in 2004 and 2006, respectively.He worked with the Department of Computer Science andEngineering, Northern University, Bangladesh, from 2004 to2007 as faculty member. He is the faculty member of theDepartment of Computer Science and Engineering,
  38. 38. Thanks To All

×