Garbage-free reversible constant multipliers for arbitrary integers

Torben Ægidius Mogensen

doi:10.1007/978-3-642-38986-3_7

Garbage-free reversible constant multipliers for arbitrary integers

Torben Ægidius Mogensen

Department of Computer Science

4 Citations (Scopus)

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.

Original language	English
Title of host publication	Reversible Computation : 5th International Conference, RC 2013, Victoria, BC, Canada, July 4-5, 2013. Proceedings
Editors	Gerhard W. Dueck, D. Michael Miller
Number of pages	14
Publisher	Springer
Publication date	2013
Pages	70-83
ISBN (Print)	978-3-642-38985-6
ISBN (Electronic)	978-3-642-38986-3
DOIs	https://doi.org/10.1007/978-3-642-38986-3_7
Publication status	Published - 2013
Event	5th International Conference on Reversible Computation - Victoria, Canada Duration: 4 Jul 2013 → 5 Jul 2013 Conference number: 5

Conference

Conference	5th International Conference on Reversible Computation
Number	5
Country/Territory	Canada
City	Victoria
Period	04/07/2013 → 05/07/2013

Series	Lecture notes in computer science
Volume	7948
ISSN	0302-9743

Access to Document

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

Cite this

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 proceeding › Article in proceedings › Research › peer-review

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

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

note = "5th International Conference on Reversible Computation ; Conference date: 04-07-2013 Through 05-07-2013",

}

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

T2 - 5th International Conference on Reversible Computation

Y2 - 4 July 2013 through 5 July 2013

ER -