Aug. Sep. 2019 Oct.
SunMonTueWedThuFriSat
01020304050607
08091011121314
1516 17 18 192021
22232425262728
29300102030405
Click Seminar

Past Seminars

DateMay 17, 2016 (Tuesday)
Time16:30-17:30
SpeakerMathias Soeken 
ProfileSwiss Federal Institute of Technology in Lausanne (EPFL)
TitleAncilla-free reversible logic synthesis using symbolic methods
 
Abstract
Due to the properties of reversibility, reversible circuit synthesis that is optimum in 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 exist 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 decision diagrams and Boolean satisfiability 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.
SiteVBL 301B