A Synthesis Method for MVL Reversible Logic

• Venue: ISMVL '04 Proceedings of the 34th International Symposium on Multiple-Valued Logic
• Year: 2004

An r-valued m-variable reversible logic functionmaps each of the r^m input patters to a unique outputpattern. The synthesis problem is to realize a reversiblefunction by a cascade of primitive reversible gates.In this paper, we present a simple heuristic algorithmthat exploits the bidirectional synthesis possibilityinherent in the reversibility of the specification. Theprimitive reversible gates considered here are onepossible extension of the well-known binary Toffoligates.We present exhaustive results for the 9! 2-variable 3-valued reversible functions comparing the results of our algorithm to optimal results found by breadth-firstsearch. The approach can be applied to general m-variable,r-valued reversible specifications. Further, weshow how the presented technique can be applied toirreversible specifications. The synthesis of a 3-input,3-valued adder is given as a specific case.