Templates for reversible circuit simplification

Even using quite powerful computers, it is still only feasible to find guaranteed optimal circuits for at most 3-input 3-output reversible Boolean functions. Hence, a number of heuristic synthesis methods have emerged. Application of such methods usually results in non-optimal circuit specifications, which can, potentially, be simplified. The template approach discussed in this paper is a local optimization technique for reversible circuit simplification that can be applied for general cost metrics. We present some results on the efficient construction, generalized classification, and completeness of a set of generalized Toffoli gate templates.