Toffolinetworksynthesiswithtemplates.pdfVIP

IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, VOL. ???, NO. ???, ??? 2004 1 Toffoli Network Synthesis with Templates Dmitri Maslov, Gerhard W. Dueck, Member, IEEE , and D. Michael Miller, Member, IEEE Abstract— Reversible logic functions can be realized as net- We follow the two-step approach suggested in [12]. First works of Toffoli gates. The synthesis of Toffoli networks can be a network that uses minimal garbage is found for a given divided into two steps. First, find a network that realizes the function. The algorithm for this step is guaranteed to converge. desired function. Second, transform the network such that it uses fewer gates, while realizing the same function. This paper It uses no backtracking or look-ahead and is thus very fast. addresses the above synthesis approach. The second step consists of applying transformations which We present a basic method and, based on that, a bidirectional reduce the number of gates in the network synthesized in the synthesis algorithm which produces a network of Toffoli gates first step. realizing a given reversible specification. An asymptotically op- Several authors have considered transformations for re- timal modification of the basic synthesis algorithm employing generalized mEXOR gates is also presented. versible networks. Shende et. al [15], [16] used several 4- Transformations are then applied using template matching. bit network equivalences to be able to rewrite a limited set The basis for a template is a network of gates that realizes of gates in a different order. In our work