Reversible in-place carry-lookahead addition with few ancillae
Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
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.
| Original language | English |
|---|---|
| Title of host publication | Reversible Computation : 11th International Conference, RC 2019, Proceedings |
| Editors | Michael Kirkedal Thomsen, Mathias Soeken |
| Number of pages | 14 |
| Publisher | Springer |
| Publication date | 2019 |
| Pages | 224-237 |
| ISBN (Print) | 9783030214999 |
| DOIs | |
| Publication status | Published - 2019 |
| Event | 11th International Conference on Reversible Computation, RC 2019 - Lausanne, Switzerland Duration: 24 Jun 2019 → 25 Jun 2019 |
Conference
| Conference | 11th International Conference on Reversible Computation, RC 2019 |
|---|---|
| Land | Switzerland |
| By | Lausanne |
| Periode | 24/06/2019 → 25/06/2019 |
| Series | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
|---|---|
| Volume | 11497 LNCS |
| ISSN | 0302-9743 |
ID: 239809340