Abstract
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Wille, R., Drechsler, R.: BDD-based synthesis of reversible logic for large functions. In: Design Automation Conf. (2009)
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)
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)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Stanković, M., Stojković, S. (2012). Reversible Synthesis in the Walsh Hadamard Domain. In: Moreno-Díaz, R., Pichler, F., Quesada-Arencibia, A. (eds) Computer Aided Systems Theory – EUROCAST 2011. EUROCAST 2011. Lecture Notes in Computer Science, vol 6928. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-27579-1_40
Download citation
DOI: https://doi.org/10.1007/978-3-642-27579-1_40
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-27578-4
Online ISBN: 978-3-642-27579-1
eBook Packages: Computer ScienceComputer Science (R0)