Abstract

A new algorithm is given that converts a reduced representation of Boolean functions in the form of disjoint cubes to unnormalized paired Haar spectra for systems of incompletely specified Boolean functions. Since the known algorithms that generate unnormalized Haar spectra always start from the truth table of Boolean functions the method presented computes faster with a smaller computer memory. The method is extremely efficient for such Boolean functions that are described by only few disjoint cubes and it allows the calculation of only selected spectral coefficients, or all the coefficients can be calculated in parallel.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call