Parallel Processing Letters · 2009 · 20 citations · 11 references
EngineeringComputer EngineeringComputer ScienceComputer ArchitectureQuantum ComputingVlsi DesignCircuit ComplexityLogic SynthesisLow-power Digital Circuit DesignParallel ArchitecturesQuantum CircuitsArithmetic Circuit SynthesisArithmetic CircuitsFast Arithmetic CircuitsMultiplier DesignParallelizationPower EfficiencyReversible Circuit DesignRipple-carry Logic
The design of fast arithmetic logic circuits is an important research topic for reversible and quantum computing. A special challenge in this setting is the computation of standard arithmetical functions without the generation of garbage. Here, we present a novel parallelization scheme wherein m parallel k-bit reversible ripple-carry adders are combined to form a reversible mk-bit ripple-block carry adder with logic depth [Formula: see text] for a minimal logic depth [Formula: see text], thus improving on the mk-bit ripple-carry adder logic depth [Formula: see text]. The underlying mechanisms of the parallelization scheme are formally proven correct. We also show designs for garbage-less reversible comparison circuits. We compare the circuit costs of the resulting ripple-block carry adder with known optimized reversible ripple-carry adders in measures of circuit delay, width, gate, transistor count, and relative power efficiency, and find that the parallelized adder offers significant speedups at realistic word sizes with modest parallelization overhead.
11
Logical Reversibility of Computation
C. H. Bennett · IBM Journal of Research and Development · 1973 · 3.7K citations
Edward Fredkin, Tommaso Toffoli · International Journal of Theoretical Physics · 1982 · 1.8K citations
Richard P. Feynman · Optics News · 1985 · 1K citations
Quantum networks for elementary arithmetic operations
Vlatko Vedral, Adriano Barenco, Artur Ekert · Physical Review A · 1996 · 822 citations · Full text
Computing, Computer Science, Physics +17