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.

Reversible logic synthesis has become a fast developing area. In order to construct reversible logic gate network, this paper presents an algorithm of iterative construct reversible network by cascade operation. The cascade operation was implemented with Boolean permutation. We proposed two important decision condition of Boolean permutation, and changed to choose balance function of suffice Boolean permutation condition for the problem of construct reversible network. The result of algorithm analysis show that it is can be implemented fleetly.