Facta universitatis - series: Electronics and Energetics 2015 Volume 28, Issue 2, Pages: 251-262
https://doi.org/10.2298/FUEE1502251S
Full text ( 667 KB)
Cited by
Complexity reduction of Toffoli networks based on FDD
Stojković Suzana (Faculty of Electronic Engineering, Niš)
Stanković Milena (Faculty of Electronic Engineering, Niš)
Moraga Claudio (Centre for Soft Computing, Mieres, Asturias, Spain + TU Dortmund University, Dortmund, Germany)
Synthesis of switching functions by Toffoli gates has become a very important
research topic in the last years, since Toffoli gates are used in the
synthesis of reversible circuits. Early methods based on the truth-table
representation of Boolean functions are applicable to functions with a
relatively small number of variables. Later on, methods for synthesis by
Toffoli gates based on decision diagrams (BDDs, FDDs or OKFDDs) were
introduced and applied to the synthesis of both reversible and irreversible
functions. This paper presents a method for the reduction of the number of
lines and gates in the Toffoli gate realization of Boolean functions based on
their Functional Decision Diagram (FDD) representation. Experiments show
that, when the proposed reduction is used, the realization of the given
function based on FDD will, on the average, be smaller in terms of the number
of lines and the number of gates than the realizations based on an OKFDD, an
optimal BDD or based on a FDD by using previously defined algorithms.
Keywords: Switching functions synthesis, Toffoli gates, Binary Decision Diagrams, Functional Decision Diagrams