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

Datalogisk Institut

4 Citationer (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.

Originalsprog	Engelsk
Titel	Reversible Computation : 5th International Conference, RC 2013, Victoria, BC, Canada, July 4-5, 2013. Proceedings
Redaktører	Gerhard W. Dueck, D. Michael Miller
Antal sider	14
Forlag	Springer
Publikationsdato	2013
Sider	70-83
ISBN (Trykt)	978-3-642-38985-6
ISBN (Elektronisk)	978-3-642-38986-3
DOI	https://doi.org/10.1007/978-3-642-38986-3_7
Status	Udgivet - 2013
Begivenhed	5th International Conference on Reversible Computation - Victoria, Canada Varighed: 4 jul. 2013 → 5 jul. 2013 Konferencens nummer: 5

Konference

Konference	5th International Conference on Reversible Computation
Nummer	5
Land/Område	Canada
By	Victoria
Periode	04/07/2013 → 05/07/2013

Navn	Lecture notes in computer science
Vol/bind	7948
ISSN	0302-9743

Adgang til dokumentet

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

Citationsformater

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. red. / Gerhard W. Dueck; D. Michael Miller. Springer, 2013. s. 70-83 (Lecture notes in computer science, Bind 7948).

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

Mogensen, TÆ 2013, Garbage-free reversible constant multipliers for arbitrary integers. i GW Dueck & DM Miller (red), Reversible Computation: 5th International Conference, RC 2013, Victoria, BC, Canada, July 4-5, 2013. Proceedings. Springer, Lecture notes in computer science, bind 7948, s. 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 -