Symmetry in Reversible Functions and Circuits
Paweł Kerntopf , Marek Szyprowski
AbstractSymmetric functions are a class of Boolean functions which are very important in logic circuit design and many other areas of computer science. Totally symmetric ninput 1-output functions are defined as ones for which any permutation of n variables gives the function itself. Reversible functions are n-input n-output bijective mappings. Thus permutations of variables in reversible functions lead inherently to different functions. The traditional notion of symmetry can only be applied to their component functions. However, we consider a new kind of symmetry and study how it can be useful in the reversible circuit synthesis.
|Book||Bertacco Valeria, Markov Igor (eds.): Proceedings of the 20th International Workshop on Logic and Synthesis (IWLS 2011), 2011, University of California, San diego, 170 p.|
|Project||Synthesis of reversible logic circuits – new approaches and algorithms. Project leader: Kerntopf Paweł,
, Phone: +48 22 234 7711, start date 17-05-2010, end date 16-11-2012, II/2010/M/2, Completed
|Publication indicators||= 2.0|
|Citation count*||2 (2015-12-05)|
* presented citation count is obtained through Internet information analysis and it is close to the number calculated by the Publish or Perish system.