A novel synthesis algorithm for reversible circuits

Abstract

Abstract-In this paper, a new non-search based synthesis algorithm for reversible circuits is proposed. Compared with the widely used search-based methods, our algorithm is guarantied to produce a result and can lead to a solution with much fewer steps. To evaluate the proposed method, several circuits taken from the literature are used. The experimental results corroborate the expected findings.

Design of a floating-point adder/subtractor based on reversible circuits

“…The current approaches to developing reversible logic circuits are typically classi ed based on their scale. Small-scale methods include the substitution method [11], the Reed-Muller spread-based synthesis method [12], and the genetic synthesis method. Large-scale methods include binary decision diagrams (BDD) and positive Davio Diagrams (PDD) [13], which are both based on binary decision diagrams.…”

An Algorithm Based on Related-Selection for Network of Reversible Logic Gates

“…The synthesis of reversible network is far more complicated than traditional synthesis of irreversible network, and it is hard to synthesis with traditional method. Some heuristic algorithm was put forward, Pallv Gupta [1] proposed a method based on PPRM extension, D. M. Miller [3] proposed a method using Spectral techniques, Mehdi Saeedi [4] proposed new non-search based synthesis algorithm and Yexin Zheng [7] used a weighted, directed graph for reversible function representation, and proposed a method based on POT transformation.…”

“…algorithm, the average gate count down to only 5.657, which is superior to the POT and Transformation algorithm, and we get a good result.Compare the optimization algorithm to other algorithm such as PPRM extension[1], non-search algorithm[4], POT algorithm[2], through examples in benchmark, as shown in Table2, we modify our optimization algorithm with adding PNC gate, our average gate count drops to 5. 88.…”