Abstract
The minterm-ring algorithm determines prime implicants (PIs) and essential prime implicants (EPIs) of a switching function by counting the number of links of each minterm to logically adjacent minterms. The method directly produces a reduced prime implicant table by identifying EPIs at each stage of the process. Minterm-ring maps provide a 3-dimensional perspective for visual identification of implicants, PIs, and EPIs. Two classical methods for simplifying Boolean algebra expressions are the Karnaugh map method and the Quine-McCluskey tabulation method. The minterm-ring method combines map techniques and an algorithm for simplifying Boolean expressions of five or more variables. >
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.
