• DocumentCode
    2636019
  • Title

    Synthesizing Reversible Circuits for Irreversible Functions

  • Author

    Miller, D. Michael ; Wille, Robert ; Dueck, Gerhard W.

  • Author_Institution
    Dept. of Comput. Sci., Univ. of Victoria, Victoria, BC, Canada
  • fYear
    2009
  • fDate
    27-29 Aug. 2009
  • Firstpage
    749
  • Lastpage
    756
  • Abstract
    Many reversible circuit synthesis procedures have been proposed. A common feature of most methods is that the initial specification must be a completely-specified reversible function. However, often the desired functionality is a, possibly incompletely-specified, irreversible function. In this paper, we consider how to fully automate the process of synthesizing a reversible function given an irreversible specification with particular emphasis on how to embed an irreversible function into a reversible specification. Systematic procedures are presented and results for benchmark problems show the methods produce very good results compared to earlier methods.
  • Keywords
    Boolean functions; adders; digital arithmetic; network synthesis; Boolean function; Toffoli gate full adder; irreversible function; irreversible specification; reversible circuit synthesis; reversible function; reversible specification; Application software; Circuit synthesis; Computer architecture; Computer science; Design methodology; Digital systems; Genetic algorithms; Optical computing; Optical design; Quantum computing; don´t-care assignment; irreversible functions; reversible circuits; synthesis;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Digital System Design, Architectures, Methods and Tools, 2009. DSD '09. 12th Euromicro Conference on
  • Conference_Location
    Patras
  • Print_ISBN
    978-0-7695-3782-5
  • Type

    conf

  • DOI
    10.1109/DSD.2009.186
  • Filename
    5350103