A Fast Symbolic Transformation Based Algorithm for Reversible Logic Synthesis

We present a more concise formulation of the transformation based synthesis approach for reversible logic synthesis, which is one of the most prominent explicit ancilla-free synthesis approaches. Based on this formulation we devise a symbolic variant of the approach that allows one to find a circuit in shorter time using less memory for the function representation. We present both a BDD based and a SAT based implementation of the symbolic variant. Experimental results show that both approaches are significantly faster than the state-of-the-art method. We were able to find ancilla-free circuit realizations for large optimally embedded reversible functions for the first time.


Editor(s):
Devitt, S
Lanese, I
Published in:
8th International Conference on Reversible Computation, RC 2016, 9720, 307-321
Presented at:
8th International Conference on Reversible Computation (RC), Univ Bologna, Comp Sci Dept, Bologna, Italy, July 7-8, 2016
Year:
2016
Publisher:
Cham, Springer Int Publishing Ag
ISBN:
978-3-319-40578-0
978-3-319-40577-3
Keywords:
Laboratories:




 Record created 2017-01-24, last modified 2018-09-13


Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)