Analysis and Improvement of Transformation-Based Reversible Logic Synthesis

An extension of transformation-based reversible and quantum circuit synthesis

“…We plan to consider implementation of the method using symbolic function representations rather then truth tables and to examine the extension of the method to partiallyspecified reversible functions. We will also consider how the concepts in [5] apply to our method. …”

“…controls sensitive to 0 rather than 1), the methods discussed here can be extended to allow them. Also, while in this paper we concentrate on MCT gates, the approach can be modified to allow other reversible gates such as Fredkin [5], [6], Peres and inverse-Peres gates [7].…”

Fredkin-Enabled Transformation-Based Reversible Logic Synthesis

“…MMD, a prominent transformation-based reversible logic synthesis, introduced in [4] and improved in [9], [5] served as the key benchmark synthesis technique for all the subsequent reversible logic synthesis approaches, in particular those which need zero ancilla lines. For the sake of completeness, we briefly review MMD in this section.…”

“…Multiple synthesis methods have been proposed to perform what can be grossly classified as first, optimal and nonscalable methods [2], [3] and second, heuristic methods [4], [5]. Heuristic methods can be further classified based on their input Boolean function representation format such as truthtables, decision diagrams, and permutations.…”

“…This observation also matches with the experiments done for template-based post-processing schemes [9], where multiple templates with swap gates are used. Another recent work attempting inclusion of Fredkin gates in transformation-based synthesis is proposed at [5], which reported improved performance for selected benchmark circuits. However, a detailed experimental study with large benchmark circuits as well as theoretical analysis are missing so far.…”