Yvan Van Rentergem

Reversible computing: from mathematical group theory to electronical circuit experiment

Reversible logic gates of a certain logic width w form a group (isomorphic to the symmetric group of order (2 w )!). Study of the subgroups of this group both teaches us a lot about properties of reversible gates and guides us to synthesize particular circuits. After design, circuits are implemented in prototype silicon chips.

Young subgroups for reversible computers

We consider the symmetric group

Implementing an arbitrary reversible logic gate

S_n

Power consumption in reversible logic addressed by a ramp voltage

in the special case where

Synthesis of reversible logic for nanoelectronic circuits

n

The decomposition of an arbitrary reversible logic circuit

is composite:

Six Synthesis Methods for Reversible Logic

n = pq

Optimal Design of A Reversible Full Adder

(both

From group theory to reversible computers

p

Multiple-valued reversible logic circuits

and