Reversible Synthesis in the Walsh Hadamard Domain

  • Milena Stanković
  • Suzana Stojković
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6928)


The paper presents a method for reversible synthesis of Boolean functions based on the properties of theis Walsh-Hadamard spectra. To realize a function, each part of the reversible cascade is specified by an examination if certain appropriately defined conditions are satisfied by pairs of the Walsh-Hadamard spectral coefficients. The function to be realized is represented by a Binary Decision Diagram (BDD) and the Walsh-Hadamard spectrum is computed over this BDD. Experimental results show that the proposed method outperforms existing similar methods in terms of both the number of lines and gates.


Boolean Function Reversible Logic Residual Function Binary Decision Diagram Optimization Rule 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Wille, R., Drechsler, R.: BDD-based synthesis of reversible logic for large functions. In: Design Automation Conf. (2009)Google Scholar
  2. 2.
    Wille, R., Drechsler, R.: Effect of BDD Optimization on Synthesis of Reversible and Quantum Logic. Electronic Notes in Theoretical Computer Science (253), 57–70 (2010)CrossRefGoogle Scholar
  3. 3.
    Stanković, M., Tišić, Ž., Nikolić, S.: Synthesis of Maitra cascades by means of spectral coefficients. In: IEEE Proceedings of Computers and Digital Techniques, vol. 130(4), pp. 101–108 (1983)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Milena Stanković
    • 1
  • Suzana Stojković
    • 1
  1. 1.Faculty of Electronic EngineeringUniversity of NišNišSerbia

Personalised recommendations