Abstract
In this paper, a relationship between on-set minterms of a logic function, an arbitrary polarity vector of the variables, and the corresponding fixed polarity Reed-Muller (FPRM) coefficients is established. Using this relationship, an efficient and simple algorithm for mapping FPRM coefficients from the on-set minterms of the function for a given polarity vector is presented. Another heuristic algorithm for finding an optimal polarity vector from the on-set minterms that produces the near minimum fixed polarity Reed-Muller expression (FPRME) is also presented. Both these algorithms are developed for single-output fully specified logic functions.
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.
