Abstract
A new algorithm is given that converts disjoint cube representation of boolean functions into fixed-polarity generalized Reed-Muller expansions (GRME). Since the known fast algorithm that generates the GRME based on the factorization of the Reed-Muller transform matrix always starts from the truth table (minterms) of a boolean function, the method described has the advantages that come from requiring a smaller computer memory. Moreover, for the boolean functions described by only a few disjoint cubes, the method is much more efficient than the fast algorithm. The algorithm allows either the calculation of only selected Reed-Muller coefficients, or all the coefficients can be calculated in parallel.
Sign-in/Register to access full text options 
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
