Heuristic algorithm of quasi-optimal reversible circuits synthesis
Andrzej Skorupski, Krzysztof Gracki, M. Pawłowski, Paweł Kerntopf · 2014
In this paper a new method of reversible circuits synthesis is presented. The method is based on iterative ordering of bits in subsequent output columns of the truth table of a reversible function until the output part of the truth table becomes identical with the input part. The length of the estimated shortest sequence which would guarantee the proper orderof bits in all output columns is a criterion for choosing a gate at each step of the proposed algorithm. For over 80% of 3-variable reversible functions the algorithm generates optimal circuits.