Garbage-free reversible constant multipliers for arbitrary integers

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

Standard

Garbage-free reversible constant multipliers for arbitrary integers. / Mogensen, Torben Ægidius.

Reversible Computation: 5th International Conference, RC 2013, Victoria, BC, Canada, July 4-5, 2013. Proceedings. ed. / Gerhard W. Dueck; D. Michael Miller. Springer, 2013. p. 70-83 (Lecture notes in computer science, Vol. 7948).

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

Harvard

Mogensen, TÆ 2013, Garbage-free reversible constant multipliers for arbitrary integers. in GW Dueck & DM Miller (eds), Reversible Computation: 5th International Conference, RC 2013, Victoria, BC, Canada, July 4-5, 2013. Proceedings. Springer, Lecture notes in computer science, vol. 7948, pp. 70-83, 5th International Conference on Reversible Computation, Victoria, Canada, 04/07/2013. https://doi.org/10.1007/978-3-642-38986-3_7

APA

Mogensen, T. Æ. (2013). Garbage-free reversible constant multipliers for arbitrary integers. In G. W. Dueck, & D. M. Miller (Eds.), Reversible Computation: 5th International Conference, RC 2013, Victoria, BC, Canada, July 4-5, 2013. Proceedings (pp. 70-83). Springer. Lecture notes in computer science Vol. 7948 https://doi.org/10.1007/978-3-642-38986-3_7

Vancouver

Mogensen TÆ. Garbage-free reversible constant multipliers for arbitrary integers. In Dueck GW, Miller DM, editors, Reversible Computation: 5th International Conference, RC 2013, Victoria, BC, Canada, July 4-5, 2013. Proceedings. Springer. 2013. p. 70-83. (Lecture notes in computer science, Vol. 7948). https://doi.org/10.1007/978-3-642-38986-3_7

Author

Mogensen, Torben Ægidius. / Garbage-free reversible constant multipliers for arbitrary integers. Reversible Computation: 5th International Conference, RC 2013, Victoria, BC, Canada, July 4-5, 2013. Proceedings. editor / Gerhard W. Dueck ; D. Michael Miller. Springer, 2013. pp. 70-83 (Lecture notes in computer science, Vol. 7948).

Bibtex

@inproceedings{236aea95ff2f481daff4f0eaf0016d40,
title = "Garbage-free reversible constant multipliers for arbitrary integers",
abstract = "We present a method for constructing reversible circuitry for multiplying integers by arbitrary integer constants. The method is based on Mealy machines and gives circuits whose size are (in the worst case) linear in the size of the constant. This makes the method unsuitable for large constants, but gives quite compact circuits for small constants. The circuits use no garbage or ancillary lines.",
author = "Mogensen, {Torben {\AE}gidius}",
year = "2013",
doi = "10.1007/978-3-642-38986-3_7",
language = "English",
isbn = "978-3-642-38985-6",
series = "Lecture notes in computer science",
publisher = "Springer",
pages = "70--83",
editor = "Dueck, {Gerhard W.} and Miller, {D. Michael}",
booktitle = "Reversible Computation",
address = "Switzerland",
note = "null ; Conference date: 04-07-2013 Through 05-07-2013",

}

RIS

TY - GEN

T1 - Garbage-free reversible constant multipliers for arbitrary integers

AU - Mogensen, Torben Ægidius

N1 - Conference code: 5

PY - 2013

Y1 - 2013

N2 - We present a method for constructing reversible circuitry for multiplying integers by arbitrary integer constants. The method is based on Mealy machines and gives circuits whose size are (in the worst case) linear in the size of the constant. This makes the method unsuitable for large constants, but gives quite compact circuits for small constants. The circuits use no garbage or ancillary lines.

AB - We present a method for constructing reversible circuitry for multiplying integers by arbitrary integer constants. The method is based on Mealy machines and gives circuits whose size are (in the worst case) linear in the size of the constant. This makes the method unsuitable for large constants, but gives quite compact circuits for small constants. The circuits use no garbage or ancillary lines.

U2 - 10.1007/978-3-642-38986-3_7

DO - 10.1007/978-3-642-38986-3_7

M3 - Article in proceedings

SN - 978-3-642-38985-6

T3 - Lecture notes in computer science

SP - 70

EP - 83

BT - Reversible Computation

A2 - Dueck, Gerhard W.

A2 - Miller, D. Michael

PB - Springer

Y2 - 4 July 2013 through 5 July 2013

ER -

ID: 149085790