Abstract
An algorithm that converts disjoint cube representation of Boolean functions into fixed-polarity generalized Reed-Muller expansions (GRME) is presented. Since the known fast algorithm that generates the GRME based on the factorization of the Reed-Muller transform matrix always start from the truth table (minterm) of Boolean function, then the described method has an advantage due to smaller required computer memory. Moreover, for the Boolean functions described by only a few disjoint cubes the method is much more efficient than the fast algorithm. >
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
