An efficient algorithm for the calculation of Generalized Adding and Arithmetic transforms from disjoint cubes of Boolean functions

A new algorithm is given that converts a reduced representation of Boolean functions in the form of disjoint cubes to Generalized Adding and Arithmeti c spectra. Since the known algorithms that generate Adding and Arithmetic s pectra always start from the truth table of Boolean functions the method pr esented computes faster with a smaller computer memory. The method is extre mely efficient for such Boolean functions that are described by only few di sjoint cubes and it allows the calculation of only selected spectral coeffi cients, or all the coefficients can be calculated in parallel.