Abstract :
Abstract—There are several algorithms that determine directly an irredundant normal form (INF) of a Boolean function without generating the entire set of prime implicants. These algorithms can generate solutions for the minimization problem much more rapidly than the algorithms determining minimum normal forms (MNF), and the cost of these solutions is, in many cases, very close to the minimum.
Keywords :
Index Terms—Approximate minimization algorithms, automatic generation, Boolean functions, essential prime implicants, irredundant normal forms.; Application software; Binary codes; Boolean functions; Cost function; Minimization methods; Telephony; Index Terms—Approximate minimization algorithms, automatic generation, Boolean functions, essential prime implicants, irredundant normal forms.;
