Fast exact Toffoli network synthesis of reversible logic

— The research in the field of reversible logic is motivated by its application in low-power design, optical computing and quantum computing. Hence synthesis of reversible logic has become a very important research area in the last years. In this paper exact algorithms for the synthesis of generalized Toffoli networks are considered. We present an improvement of an existing synthesis approach that is based on Boolean Satisfiability. Furthermore, the principle limits of the original and the improved approach are shown. Then, we propose a new method using problem specific knowledge during the synthesis process to overcome these limits. Experimental results demonstrate improvements of the overall synthesis time up to four orders of magnitude.

• Type: Conference
• Year: 2007
• Where: ICCAD
• Authors: Robert Wille, Daniel Große
• Keywords: Hardware, ICCAD 2007, Overall Synthesis Time, Synthesis Approach, Synthesis Process