Upper bounds for reversible circuits based on Young subgroups

Research output: Contribution to journal › Journal article › Research › peer-review

Standard

Upper bounds for reversible circuits based on Young subgroups. / Abdessaied, Nabila; Soeken, Mathias; Thomsen, Michael Kirkedal; Drechsler, Rolf.

In: Information Processing Letters, Vol. 114, No. 6, 2014, p. 282-286.

Research output: Contribution to journal › Journal article › Research › peer-review

Harvard

Abdessaied, N, Soeken, M, Thomsen, MK & Drechsler, R 2014, 'Upper bounds for reversible circuits based on Young subgroups', Information Processing Letters, vol. 114, no. 6, pp. 282-286. https://doi.org/10.1016/j.ipl.2014.01.003

APA

Abdessaied, N., Soeken, M., Thomsen, M. K., & Drechsler, R. (2014). Upper bounds for reversible circuits based on Young subgroups. Information Processing Letters, 114(6), 282-286. https://doi.org/10.1016/j.ipl.2014.01.003

Vancouver

Abdessaied N, Soeken M, Thomsen MK, Drechsler R. Upper bounds for reversible circuits based on Young subgroups. Information Processing Letters. 2014;114(6):282-286. https://doi.org/10.1016/j.ipl.2014.01.003

Author

Abdessaied, Nabila ; Soeken, Mathias ; Thomsen, Michael Kirkedal ; Drechsler, Rolf. / Upper bounds for reversible circuits based on Young subgroups. In: Information Processing Letters. 2014 ; Vol. 114, No. 6. pp. 282-286.

Bibtex

@article{e2805606b7b84878bcf9cfdc96e7ef40,
title = "Upper bounds for reversible circuits based on Young subgroups",
abstract = "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%.",
keywords = "Combinatorial problems, Reversible functions, Synthesis, Upper bounds",
author = "Nabila Abdessaied and Mathias Soeken and Thomsen, {Michael Kirkedal} and Rolf Drechsler",
year = "2014",
doi = "10.1016/j.ipl.2014.01.003",
language = "English",
volume = "114",
pages = "282--286",
journal = "Information Processing Letters",
issn = "0020-0190",
publisher = "Elsevier",
number = "6",

}

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