A General Decomposition for Reversible Logic
Marek A. Perkowski, L. Jóźwiak, Paweł Kerntopf, Alan Mishchenko, Anas N. Al‐Rabadi, A. Coppola, Andrzej Buller, Xiaoyu Song, Svetlana N. Yanushkevich, Vlad P. Shmerko, Malgorzata Chrzanowska-Jeske, Mozammel H. A. Khan · TU/e Research Portal · 2001
Logic synthesis for reversible logic differs considerably from standard logic synthesis. The gates are multi-output and the unutilized outputs from these gates are called “garbage”. One of the synthesis tasks is to reduce the number of garbage signals. Previous approaches to reversible logic synthesis minimized either only the garbage or (predominantly) the number of gates. Here we present for the first time a method that minimizes concurrently the number of gates, their total delay and the total garbage. Our method adopts for reversible logic many ideas developed previously for standard logic synthesis (such as Ashenhurst/Curtis Decomposition, Dietmeyer’s Composition, non-linear preprocessing for BDDs), methods created in Reed- Muller Logic (such as Pseudo-Kronecker Decision Diagrams with Complemented Edges, Pseudo-Kronecker Lattice Diagrams and their generalizations) and introduces also new methods specific to reversible logic.