Generation of multi-polarity arithmetic transform from reduced representation of Boolean functions

A new algorithm is given that converts a reduced representation of Boolean functions in the form of disjoint cubes to multi-polarity arithmetic spectrum. Since the known algorithms that generate arithmetic spectrum always start from the truth table of Boolean functions the method presented computes faster with a smaller required memory. The algorithm 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, of all the coefficients which can be calculated in parallel