Reversible Circuit Synthesis Using a Cycle-Based Approach

IEEE Transactions on …, 2003

Proceedings of the 2002 …, 2002

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2006

Reversible logic finds many applications, especially in the area of quantum computing. A completely specified n-input, n-output Boolean function is called reversible if it maps each input assignment to a unique output assignment and vice versa. Logic synthesis for reversible functions differs substantially from traditional logic synthesis and is currently an active area of research. The authors present an algorithm and tool for the synthesis of reversible functions. The algorithm uses the positive-polarity Reed-Muller expansion of a reversible function to synthesize the function as a network of Toffoli gates. At each stage, candidate factors, which represent subexpressions common between the Reed-Muller expansions of multiple outputs, are explored in the order of their attractiveness. The algorithm utilizes a prioritybased search tree, and heuristics are used to rapidly prune the search space. The synthesis algorithm currently targets the generalized n-bit Toffoli gate library. However, other algorithms exist that can convert an n-bit Toffoli gate into a cascade of smaller Toffoli gates. Experimental results indicate that the authors' algorithm quickly synthesizes circuits when tested on the set of all reversible functions of three variables. Furthermore, it is able to quickly synthesize all four-variable and most five-variable reversible functions that were in the test suite. The authors also present results for some benchmark functions widely discussed in literature and some new benchmarks that the authors have developed. The algorithm is shown to synthesize many, but not all, randomly generated reversible functions of as many as 16 variables with a maximum gate count of 25.

2016 IEEE International Symposium on Circuits and Systems (ISCAS), 2016

Transformation-based synthesis is a well established systematic approach to determine a circuit implementation from a reversible function specification. Due to the inherent bidirectionality of reversible circuits the basic method can be applied in a bidirectional manner. In the approaches to date, gates are added either to the input side or the output side of the circuit on each iteration. In this paper, we introduce a new variation where gates may be added at both ends during a single iteration when this is advantageous to reducing the cost of the circuit. Experimental results show the advantage of the new approach over previous transformation-based synthesis methods and that the additional computation is justified by the possibility of improved circuit costs.

Reversible logic circuits have been historically motivated by theoretical research in low-power electronics as well as practical improvement of bit-manipulation transforms in cryptography and computer graphics. Recently, reversible circuits have attracted interest as components of quantum algorithms, as well as in photonic and nano-computing technologies where some switching devices offer no signal gain. Research in generating reversible logic distinguishes between circuit synthesis, post-synthesis optimization, and technology mapping. In this survey, we review algorithmic paradigms -search-based, cycle-based, transformationbased, and BDD-based -as well as specific algorithms for reversible synthesis, both exact and heuristic. We conclude the survey by outlining key open challenges in synthesis of reversible and quantum logic, as well as most common misconceptions.

2004

ACM Computing Surveys, 2013

Reversible logic circuits have been historically motivated by theoretical research in low-power electronics as well as practical improvement of bit-manipulation transforms in cryptography and computer graphics. Recently, reversible circuits have attracted interest as components of quantum algorithms, as well as in photonic and nano-computing technologies where some switching devices offer no signal gain. Research in generating reversible logic distinguishes between circuit synthesis, post-synthesis optimization, and technology mapping. In this survey, we review algorithmic paradigms-search-based, cycle-based, transformationbased, and BDD-based-as well as specific algorithms for reversible synthesis, both exact and heuristic. We conclude the survey by outlining key open challenges in synthesis of reversible and quantum logic, as well as most common misconceptions. 1 While charge recovery reminds conservative logic [Fredkin and Toffoli 1982], its essential property is to avoid dissipating electric charges by exchanging them. This property requires transistor-level support and is not specific to logic circuits as it also applies to clock networks.

IEEE Computer Society Annual Symposium on VLSI: New Frontiers in VLSI Design (ISVLSI'05), 2005

Quantum computing is one of the most promising emerging technologies of the future. Reversible circuits are an important class of Quantum circuits. In this paper, we investigate the problem of optimally synthesizing fourqubit reversible circuits. We present an enhanced bidirectional synthesis approach. Due to the superexponential increase on the memory requirement, all the existing methods can only perform four steps for the CNP (Control-Not gate, NOT gate, and Peres gate) library. Our novel method can achieve 12 steps. As a result, we augment the number of circuits that can be optimally synthesized by over 5*10 6 times. Moreover, our approach is faster than the existing approaches by orders of magnitude. The promising experimental results demonstrate the effectiveness of our approach.

Design, Automation, and Test in Europe, 2004

A function is reversible if each input vector produces a unique output vector. Reversible functions find applications in low power design, quantum computing, and nanotechnology. Logic synthesis for reversible circuits differs substantially from traditional logic synthesis. In this paper, we present the .rst practical synthesis algorithm and tool for reversible functions with a large number of inputs. It uses positive-polarity

IEICE Electronics Express, 2008

Reversible circuits have applications in various research areas including signal processing, cryptography and quantum computation. In this paper, a non-search based moving forward synthesis algorithm (MOSAIC) for Boolean reversible circuits is proposed to convert an arbitrary well-formed matrix into an identity matrix using a set of reversible gates. In contrast with the widely used search-based methods, MOSAIC is guaranteed to produce a result and can lead to a solution in much fewer algorithmic steps. To evaluate the proposed algorithms, different circuits and benchmarks were used that show the efficiency of the proposed algorithm to lead a result.