Upper bounds for reversible circuits based on Young subgroups
Publikation: Bidrag til tidsskrift › Tidsskriftartikel › Forskning › fagfællebedømt
Standard
Upper bounds for reversible circuits based on Young subgroups. / Abdessaied, Nabila; Soeken, Mathias; Thomsen, Michael Kirkedal; Drechsler, Rolf.
I: Information Processing Letters, Bind 114, Nr. 6, 2014, s. 282-286.Publikation: Bidrag til tidsskrift › Tidsskriftartikel › Forskning › fagfællebedømt
Harvard
APA
Vancouver
Author
Bibtex
}
RIS
TY - JOUR
T1 - Upper bounds for reversible circuits based on Young subgroups
AU - Abdessaied, Nabila
AU - Soeken, Mathias
AU - Thomsen, Michael Kirkedal
AU - Drechsler, Rolf
PY - 2014
Y1 - 2014
N2 - We present tighter upper bounds on the number of Toffoli gates needed in reversible circuits. Both multiple controlled Toffoli gates and mixed polarity Toffoli gates have been considered for this purpose. The calculation of the bounds is based on a synthesis approach based on Young subgroups that results in circuits using a more generalized gate library. Starting from an upper bound for this library we derive new bounds which improve the existing bound by around 77%.
AB - We present tighter upper bounds on the number of Toffoli gates needed in reversible circuits. Both multiple controlled Toffoli gates and mixed polarity Toffoli gates have been considered for this purpose. The calculation of the bounds is based on a synthesis approach based on Young subgroups that results in circuits using a more generalized gate library. Starting from an upper bound for this library we derive new bounds which improve the existing bound by around 77%.
KW - Combinatorial problems
KW - Reversible functions
KW - Synthesis
KW - Upper bounds
U2 - 10.1016/j.ipl.2014.01.003
DO - 10.1016/j.ipl.2014.01.003
M3 - Journal article
AN - SCOPUS:84893303513
VL - 114
SP - 282
EP - 286
JO - Information Processing Letters
JF - Information Processing Letters
SN - 0020-0190
IS - 6
ER -
ID: 139977618