Reversible in-place carry-lookahead addition with few ancillae

Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

Standard

Reversible in-place carry-lookahead addition with few ancillae. / Mogensen, Torben Ægidius.

Reversible Computation: 11th International Conference, RC 2019, Proceedings. ed. / Michael Kirkedal Thomsen; Mathias Soeken. Springer, 2019. p. 224-237 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 11497 LNCS).

Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

Harvard

Mogensen, TÆ 2019, Reversible in-place carry-lookahead addition with few ancillae. in MK Thomsen & M Soeken (eds), Reversible Computation: 11th International Conference, RC 2019, Proceedings. Springer, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 11497 LNCS, pp. 224-237, 11th International Conference on Reversible Computation, RC 2019, Lausanne, Switzerland, 24/06/2019. https://doi.org/10.1007/978-3-030-21500-2_14

APA

Mogensen, T. Æ. (2019). Reversible in-place carry-lookahead addition with few ancillae. In M. K. Thomsen, & M. Soeken (Eds.), Reversible Computation: 11th International Conference, RC 2019, Proceedings (pp. 224-237). Springer. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) Vol. 11497 LNCS https://doi.org/10.1007/978-3-030-21500-2_14

Vancouver

Mogensen TÆ. Reversible in-place carry-lookahead addition with few ancillae. In Thomsen MK, Soeken M, editors, Reversible Computation: 11th International Conference, RC 2019, Proceedings. Springer. 2019. p. 224-237. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 11497 LNCS). https://doi.org/10.1007/978-3-030-21500-2_14

Author

Mogensen, Torben Ægidius. / Reversible in-place carry-lookahead addition with few ancillae. Reversible Computation: 11th International Conference, RC 2019, Proceedings. editor / Michael Kirkedal Thomsen ; Mathias Soeken. Springer, 2019. pp. 224-237 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 11497 LNCS).

Bibtex

@inproceedings{5f2e11b1b5de4d42b9884fb861f3f659,
title = "Reversible in-place carry-lookahead addition with few ancillae",
abstract = "We present a reversible, in-place carry-lookahead adder that uses fewer ancillae than previous designs. Specifically, an N-bit adder uses only roughly N ancillae, where previous designs have used roughly 2N ancillae. The cost is 20% higher gate count and 50% higher gate delay.",
author = "Mogensen, {Torben {\AE}gidius}",
year = "2019",
doi = "10.1007/978-3-030-21500-2_14",
language = "English",
isbn = "9783030214999",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer",
pages = "224--237",
editor = "Thomsen, {Michael Kirkedal} and Mathias Soeken",
booktitle = "Reversible Computation",
address = "Switzerland",
note = "11th International Conference on Reversible Computation, RC 2019 ; Conference date: 24-06-2019 Through 25-06-2019",

}

RIS

TY - GEN

T1 - Reversible in-place carry-lookahead addition with few ancillae

AU - Mogensen, Torben Ægidius

PY - 2019

Y1 - 2019

N2 - We present a reversible, in-place carry-lookahead adder that uses fewer ancillae than previous designs. Specifically, an N-bit adder uses only roughly N ancillae, where previous designs have used roughly 2N ancillae. The cost is 20% higher gate count and 50% higher gate delay.

AB - We present a reversible, in-place carry-lookahead adder that uses fewer ancillae than previous designs. Specifically, an N-bit adder uses only roughly N ancillae, where previous designs have used roughly 2N ancillae. The cost is 20% higher gate count and 50% higher gate delay.

UR - http://www.scopus.com/inward/record.url?scp=85068213814&partnerID=8YFLogxK

U2 - 10.1007/978-3-030-21500-2_14

DO - 10.1007/978-3-030-21500-2_14

M3 - Article in proceedings

AN - SCOPUS:85068213814

SN - 9783030214999

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 224

EP - 237

BT - Reversible Computation

A2 - Thomsen, Michael Kirkedal

A2 - Soeken, Mathias

PB - Springer

T2 - 11th International Conference on Reversible Computation, RC 2019

Y2 - 24 June 2019 through 25 June 2019

ER -

ID: 239809340