An Algorithm Based on Related-Selection for Network of Reversible Logic Gates

Abstract

This paper presents an algorithm based on related selection for reversible logic synthesis, and the algorithm is optimized. The algorithm realizes the synthesis of the whole 3-varibles functions and some part of 4-varibles functions. The algorithm for the space complexity is O(n*2n). Compared with other algorithm for reversible logic synthesis at home and abroad, this algorithm has a less gate number in the synthesis of the whole 3-varibles functions and some examples in benchmark.