An efficient synthesis method for ternary reversible logic
Document Type
Conference Article
Publication Title
Proceedings - IEEE International Symposium on Circuits and Systems
Abstract
While the role of ternary reversible and quantum computation has been growing, synthesis methodologies for such logic, have been addressed in only a few works. A reversible ternary logic function can be expressed as minterms by using projection operators. In this paper, a novel realization of the projection operators using a minimum number of permutative ternary Muthukrishnan-Stroud (M-S) gates is presented. Next, an efficient method for logic simplification for ternary reversible logic is proposed. This method along with the new construction of projection operators yields significantly lower gate cost of approximately 31% less than that obtained by earlier methodologies, for the synthesis of ternary benchmark circuits.
First Page
2306
Last Page
2309
DOI
10.1109/ISCAS.2016.7539045
Publication Date
7-29-2016
Recommended Citation
Basu, Saikat; Mandal, Sudhindu Bikash; Chakrabarti, Amlan; and Sur-Kolay, Susmita, "An efficient synthesis method for ternary reversible logic" (2016). Conference Articles. 667.
https://digitalcommons.isical.ac.in/conf-articles/667
