Abstract
A method of minimization of Boolean functions is described. Though directly concerned with the evaluation of the minimal sum of products, it can be easily extended to obtain the minimal product of sums. It has been shown that, after the selection of the essential prime implicants, there exists a ‘row-merger’ step or a ‘row-merger’ and ‘row-cancellation’ step which reveals many alternative covers. The method of obtaining the solution for the cyclic prime implicant matrix has been systematized by introducing the ‘irredundant Sat-set’ and the ‘perturbation set’ of the prime implicants. The method yields all the minimal sums, however complex the problem may be.
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.
