Abstract :
A common recursive formulation is presented for determining: 1) all the prime implicants, and 2) an irredundant normal form of any completely or incompletely specified Boolean function given in canonical form. Formulas for specific operators Pi and lrr2 solving these problems are given and recursive partitioned list algorithms are described for them. The solution of both of the above problems through recursive partitioned list algorithms is significantly faster than through the corresponding nonrecursive algorithms.
Keywords :
Boolean functions, incompletely specified, irredundant normal form, minimization, multioutput functions, partitioned list, prime implicants, recursive operators.; Algorithm design and analysis; Boolean functions; Multidimensional systems; Network synthesis; Partitioning algorithms; Terminology; Boolean functions, incompletely specified, irredundant normal form, minimization, multioutput functions, partitioned list, prime implicants, recursive operators.;
