Computation of Walsh spectrum from binary decision diagram and binary decision diagram from Walsh spectrum
DOI10.1016/0045-7906(89)90011-6zbMATH Open0693.94011OpenAlexW1981536756MaRDI QIDQ5899692FDOQ5899692
Authors: Suman Purwar, A. K. Susskind 
Publication date: 1989
Published in: Computers and Electrical Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0045-7906(89)90011-6
Recommendations
- scientific article; zbMATH DE number 3949544
- Reduction of decision diagrams by disjunctive spectral translation in the Walsh-Hadamard domain
- Trace Walsh spectrum of Boolean functions
- scientific article; zbMATH DE number 2114154
- scientific article; zbMATH DE number 2091940
- Calculation of the paired Haar transform through shared binary decision diagrams
- Computing Partial Walsh Transform From the Algebraic Normal Form of a Boolean Function
- Generation of sign Walsh spectra from disjoint cubes of Boolean functions
- Computing Walsh coefficients from the algebraic normal form of a Boolean function
- The computational efficiency of a spectral Walsh function method
Numerical methods for trigonometric approximation and interpolation (65T40) Switching theory, applications of Boolean algebras to circuits and networks (94C11)
Cited In (4)
- Generation of sign Walsh spectra from disjoint cubes of Boolean functions
- Reduction of decision diagrams by disjunctive spectral translation in the Walsh-Hadamard domain
- Composite Spectra and the Analysis of Switching Circuits
- A method for the analytical determination of the Walsh transform of switching functions
This page was built for publication: Computation of Walsh spectrum from binary decision diagram and binary decision diagram from Walsh spectrum
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5899692)
