Synthesis of reversible circuits using a moving forward strategy

Abstract

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. © IEICE 2008.