Reversible in-place carry-lookahead addition with few ancillae

Torben Ægidius Mogensen

doi:10.1007/978-3-030-21500-2_14

Reversible in-place carry-lookahead addition with few ancillae

Torben Ægidius Mogensen^*

^*Corresponding author af dette arbejde

Programming Languages and Theory of Computing

Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › peer review

5 Citationer (Scopus)

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.

Originalsprog	Engelsk
Titel	Reversible Computation : 11th International Conference, RC 2019, Proceedings
Redaktører	Michael Kirkedal Thomsen, Mathias Soeken
Antal sider	14
Forlag	Springer
Publikationsdato	2019
Sider	224-237
ISBN (Trykt)	9783030214999
DOI	https://doi.org/10.1007/978-3-030-21500-2_14
Status	Udgivet - 2019
Begivenhed	11th International Conference on Reversible Computation, RC 2019 - Lausanne, Schweiz Varighed: 24 jun. 2019 → 25 jun. 2019

Konference

Konference	11th International Conference on Reversible Computation, RC 2019
Land/Område	Schweiz
By	Lausanne
Periode	24/06/2019 → 25/06/2019

Navn	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Vol/bind	11497 LNCS
ISSN	0302-9743

Adgang til dokumentet

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

Andre filer og links

Link to publication in Scopus

Citationsformater

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

Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › peer review

Mogensen, TÆ 2019, Reversible in-place carry-lookahead addition with few ancillae. i MK Thomsen & M Soeken (red), 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), bind 11497 LNCS, s. 224-237, 11th International Conference on Reversible Computation, RC 2019, Lausanne, Schweiz, 24/06/2019. https://doi.org/10.1007/978-3-030-21500-2_14

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

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

@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",

}

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 -