Abstract
A new method for computing the prime implicants of a Boolean function from an arbitrary sum-of-products form is given. It depends on the observation that the prime implicants of a Boolean function can be obtained from the prime implicants of its subfunctions with respect to a fixed but arbitrary variable. The problem of obtaining all irredundant sums from the list of all prime implicants and an arbitrary list of implicants representing the function is solved. The irredundant sums are in one-to-one relation to the prime implicants of a positive Boolean function associated with these lists. The known formulas of Petrick, Ghazala, Tison, Mott, and Chang are obtained as special cases and incompletely specified functions can also be handled. We give a complete and simple method for finding the positive Boolean function mentioned above. The paper is self-contained and examples are included.
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.
