Skip to Main Content
The iterated consensus method for obtaining prime implicants of Boolean functions has several advantages with respect to the conventional tabular method. However, when one attempts to apply the iterated consensus method to multiple-output functions using the rules set forth in the existing literature, it is possible that some of the prime implicants will not be produced. This communication presents an algorithm which assures that all prime implicants of multiple-output functions will be found.
Note: The Institute of Electrical and Electronics Engineers, Incorporated is distributing this Article with permission of the International Business Machines Corporation (IBM) who is the exclusive owner. The recipient of this Article may not assign, sublicense, lease, rent or otherwise transfer, reproduce, prepare derivative works, publicly display or perform, or distribute the Article.