• DocumentCode
    3400114
  • Title

    Design of fault tolearnt full Adder/Subtarctor using reversible gates

  • Author

    Kaur, Parminder ; Dhaliwal, Balwinder Singh

  • Author_Institution
    ECE Dept., Desh Bhagat Eng. Coll., Mandi Gobindgarh, India
  • fYear
    2012
  • fDate
    10-12 Jan. 2012
  • Firstpage
    1
  • Lastpage
    5
  • Abstract
    Reversible logic gates are in demand for the upcoming future computing technologies. Reversible logic is emerging as an important research area having its application in diverse fields such as low power CMOS design. The paper proposes the design of full Adder/Subtractor circuit using fault tolerant reversible logic gates. The design can work singly as a reversible Full Adder/Subtractor unit. It is a parity preserving reversible adder cell, that is, the parity of the inputs matches the parity of the outputs. The proposed parity preserving reversible adder can be used to synthesize any arbitrary Boolean function. It allows any fault that affects no more than a single signal readily detectable at the circuit´s primary outputs. The proposed design offers less hardware complexity and is efficient in terms of gate count, garbage outputs and constant inputs than the existing counterparts.
  • Keywords
    Boolean functions; adders; fault tolerant computing; logic design; logic gates; Boolean function; constant input; fault tolerant full adder-subtractor; fault tolerant reversible logic gates; full adder-subtractor circuit circuit design; garbage output; gate count; hardware complexity; low power CMOS design; parity preserving reversible adder cell; reversible full adder-subtractor unit; Adders; Computers; Fault tolerance; Fault tolerant systems; Informatics; Logic gates; Quantum computing; Feynman double gate; Fredkin gate; Reversible gate; delay; full adder;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computer Communication and Informatics (ICCCI), 2012 International Conference on
  • Conference_Location
    Coimbatore
  • Print_ISBN
    978-1-4577-1580-8
  • Type

    conf

  • DOI
    10.1109/ICCCI.2012.6158883
  • Filename
    6158883