Garbage-free reversible constant multipliers for arbitrary integers

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

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 languageEnglish
Title of host publicationReversible Computation : 5th International Conference, RC 2013, Victoria, BC, Canada, July 4-5, 2013. Proceedings
EditorsGerhard W. Dueck, D. Michael Miller
Number of pages14
PublisherSpringer
Publication date2013
Pages70-83
ISBN (Print)978-3-642-38985-6
ISBN (Electronic)978-3-642-38986-3
DOIs
Publication statusPublished - 2013
Event5th International Conference on Reversible Computation - Victoria, Canada
Duration: 4 Jul 20135 Jul 2013
Conference number: 5

Conference

Conference5th International Conference on Reversible Computation
Nummer5
LandCanada
ByVictoria
Periode04/07/201305/07/2013
SeriesLecture notes in computer science
Volume7948
ISSN0302-9743

ID: 149085790