Strength of the reversible, garbage-free 2ᵏ 1 multiplier

DOI10.1007/978-3-642-38986-3_5MaRDI QIDQ2868436zbMATH OpenOpenAlexFDO

Authors Eva Rotenberg, James Cranch, Michael Kirkedal Thomsen, Holger Bock Axelsen

Publication date 17 December 2013

Published in Reversible Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-38986-3_5

zbMATH Keywords

constant multiplicationMersenne numbersnumber theoryreversible circuit design

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Numerical algorithms for computer arithmetic, etc. (65Y04)

Recommendations

• Garbage-free reversible constant multipliers for arbitrary integers
• Garbage-free reversible integer multiplication with constants of the form \(2^{k}\pm 2^{l}\pm 1\)
• Garbage-free reversible multiplication and division
• Design of quantum cost efficient reversible multiplier using Reed-Muller expressions
• An efficient design for reversible Wallace unsigned multiplier

Cited in

(6)

• Garbage-free reversible multiplication and division
• Garbage-free reversible constant multipliers for arbitrary integers
• Strong Turing degrees for additive BSS RAM's
• Multiplierless multiple constant multiplication
• Garbageless reversible implementation of integer linear transformations
• Garbage-free reversible integer multiplication with constants of the form \(2^{k}\pm 2^{l}\pm 1\)

This page was built for publication: Strength of the reversible, garbage-free \(2^{k } \pm 1\) multiplier

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2868436)