Ancilla-free reversible logic synthesis using symbolic methods

Due to the properties of reversibility, optimum synthesis with respect to the number of lines is a difficult task. For an irreversible Boolean function it is coNP-hard to find an optimum embedding, i.e., a reversible function with the minimum number of additional lines. Synthesis algorithms exists that obtain from an optimum embedding ancilla-free reversible circuits which have as many circuit lines as variables in the reversible function. However, so far all implementations for such synthesis algorithms require exponential time and space since they operate on the truth table representation of the function. In the talk, alternative implementations of the algorithms based on symbolic methods are presented that allow to run the algorithm in less space and time for some functions. It is shown that high quality synthesis results for large circuits can be obtained using these implementations.Non UBCUnreviewedAuthor affiliation: École polytechnique fédérale de LausannePostdoctora