Garbage-free reversible constant multipliers for arbitrary integers

Publikation: Bidrag til bog/antologi/rapportKonferencebidrag i proceedingsForskningfagfællebedømt

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.
OriginalsprogEngelsk
TitelReversible Computation : 5th International Conference, RC 2013, Victoria, BC, Canada, July 4-5, 2013. Proceedings
RedaktørerGerhard W. Dueck, D. Michael Miller
Antal sider14
ForlagSpringer
Publikationsdato2013
Sider70-83
ISBN (Trykt)978-3-642-38985-6
ISBN (Elektronisk)978-3-642-38986-3
DOI
StatusUdgivet - 2013
Begivenhed5th International Conference on Reversible Computation - Victoria, Canada
Varighed: 4 jul. 20135 jul. 2013
Konferencens nummer: 5

Konference

Konference5th International Conference on Reversible Computation
Nummer5
LandCanada
ByVictoria
Periode04/07/201305/07/2013
NavnLecture notes in computer science
Vol/bind7948
ISSN0302-9743

ID: 149085790