Reversible logic has obtained more and more attention and research as the basis for several emerging technologies such as quantum computing

nanotechnologies and low-power design.However

currently most synthesis algorithms for reversible circuits suffer from being restricted to deal with relatively small functions only

since they rely on a truth table representation of the function to be synthesized.Decision Diagram serving as a more compact Boolean function description provides anther way to synthesis of reversible logic.Here

a synthesis approach based on Kronecker Functional Decision Diagram (KFDD) is proposed

that generates KFDD for a logic function by means of choosing the local optimal one from three alternative node decomposition types.Finally

the result circuit can be produced by substituting all nodes of the KFDD with circuit modules and cascading them.Verified by reversible benchmarks

experiments show the adaption of the proposed approach to large functions with better results.