A transformation based algorithm for reversible logic synthesis

D. Michael Miller, Dmitri Maslov, Gerhard W. Dueck

Proceedings of the 40th conference on Design automation - DAC '03 · 2003 · 55 citations · 0 references

Concepts

TL;DR

Reversible combinational logic circuits map each input pattern to a unique output pattern and are of interest for quantum, optical, nanotechnology, and low‑power CMOS applications, yet synthesis methods for even small circuits remain underdeveloped. This paper introduces a transformation‑based algorithm that synthesizes reversible circuits using n × n Toffoli gates. The algorithm first builds a circuit in a single pass through the specification with minimal look‑ahead and no back‑tracking, then applies reduction rules via simple template matching. The method achieves near‑optimal results on 3‑input circuits and delivers very good performance on larger instances.

Abstract

A digital combinational logic circuit is reversible if it maps each input pattern to a unique output pattern. Such circuits are of interest in quantum computing, optical computing, nanotechnology and low-power CMOS design. Synthesis approaches are not well developed for reversible circuits even for small numbers of inputs and outputs.In this paper, a transformation based algorithm for the synthesis of such a reversible circuit in terms of n × n Toffoli gates is presented. Initially, a circuit is constructed by a single pass through the specification with minimal look-ahead and no back-tracking. Reduction rules are then applied by simple template matching. The method produces near-optimal results for 3-input circuits and also produces very good results for larger problems.