Minimization of NAND-NOR networks by factoring
G. J. MASSET, A. J. Tosser · International Journal of Electronics · 1976
Factoring sums of Boolean products or products of Boolean sums is studied in a lot of typical cases. For this purpose, five types of minterms (direct, complemented, mixed, 1st order direct, 1st order complemented) and two main modes of factoring ( distributed, centralized) are considered. Costs of minimum NAND-NOR realizations are tabulated for complete and partial factoring. Numerical data about the opportunity of complete or partial factoring with a minterm are given for all the typical cases.