Reversible Logic Synthesis Example using a Transformation Based Algorithm

Interest in quantum computing, nanotechnology, and low power consumption circuits is fueling the expanding research in reversible logic synthesis. A reversible function is one that generates a unique output vector for every input vector. Traditional circuits are designed with AND and OR gates that allow fan-outs and loop back results which often results in inefficient energy consumption. In contrast, reversible circuits must preserve the number of outputs to the number of inputs and can only be represented as a cascade of reversible gates. Thus traditional synthesis techniques are not adequate for working with reversible functions. Miller et al. have created a novel approach for synthesizing the functions into near-optimal reversible networks. The aim of this paper is to provide a thorough example demonstrating their template matching algorithm, and summarize their work in reversible logic synthesis.