• DocumentCode
    2090064
  • Title

    Simplification of Toffoli networks via templates

  • Author

    Maslov, Dmitri ; Dueck, GerhardW ; Miller, D. Michael

  • Author_Institution
    Fac. of Comput. Sci., New Brunswick Univ., Fredericton, NB, Canada
  • fYear
    2003
  • fDate
    8-11 Sept. 2003
  • Firstpage
    53
  • Lastpage
    58
  • Abstract
    Reversible logic functions can be realized as networks of Toffoli gates. The synthesis of Toffoli networks can be divided into two steps. First, find a network that realizes the desired junction. Second, transform the network such that it uses fewer gates, while realizing the same function. This paper addresses the second step. Transformations are accomplished via template matching. The basis for a template is a network with m gates that realizes the identity function. If a sequence in the network to be synthesized matches more than half of a template, then a transformation reducing the gate count can be applied. All templates for m≤7 are described in this paper.
  • Keywords
    logic design; Toffoli gate networks; Toffoli network simplification; gate count reduction; identity function; network transformation; reversible logic functions; template matching; CMOS logic circuits; Circuit synthesis; Computer applications; Computer science; Logic functions; Nanotechnology; Network synthesis; Optical computing; Optical feedback; Quantum computing;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Integrated Circuits and Systems Design, 2003. SBCCI 2003. Proceedings. 16th Symposium on
  • Print_ISBN
    0-7695-2009-X
  • Type

    conf

  • DOI
    10.1109/SBCCI.2003.1232806
  • Filename
    1232806