Maher Hawash

Learn More
This paper presents a new algorithm MP (multiple pass) to synthesize large reversible binary circuits without ancilla bits. The well-known MMD algorithm for synthesis of reversible circuits requires to store a truth table (or a Reed-Muller-RM transform) as a 2n vector to represent a reversible function of n variables. This representation prohibits synthesis(More)
This paper presents a synthesis algorithm, Covering Set Partitions (CSP), for reversible binary functions with no ancillary (garbage) bits. Existing algorithms are constrained to functions of small number of variables because they store the entire truth table of 2 n terms in memory or require a huge amount of time to yield results because they must(More)
  • 1