Useless prime implicants of incompletely specified multiple-output switching functions |
| |
Authors: | Robert B Cutler Saburo Muroga |
| |
Affiliation: | (1) Department of Computer Science, University of Illinois at Urbana-Champaign, 61801 Urbana, Illinois |
| |
Abstract: | In the process of finding a minimal sum representation for an incompletely specified multiple-output switching function, there often occur certain types of prime implicants, referred to as useless, which can be discarded because of the presence of the don't-cares. This paper presents a correction to the definition of useless given by Tison and extends the definition to other notations. A procedure for removing useless prime implicants quickly is presented for the case when multiple-output prime implicants are derived from minterms. The deletion of useless prime implicants can, in many cases, speed up any procedure for finding a minimal sum that begins with the multiple-output prime implicants in both hand calculation and in computer implementation.This work was supported in part by the National Science Foundation under Grant No. MCS-77-09744. |
| |
Keywords: | Boolean minimization covering problem logic design minimal sum prime implicants multiple-output prime implicants useless prime implicants |
本文献已被 SpringerLink 等数据库收录! |