Abstract :
A TANT network is a three-level network composed solely of AND-NOT gates having only uncomplemented inputs. A method of minimal gate TANT realization of a Boolean function is presented. The procedure permits hand solution of four-and five-variable problems. A computer program will be required to handle more complex cases.
Keywords :
Consensus operation, essential prime implicants, gate cost criterion, minimal TANT expression, TANT networks.; Automata; Boolean functions; Computational complexity; Computer networks; Costs; Digital systems; Logic circuits; Minimization; Upper bound; Consensus operation, essential prime implicants, gate cost criterion, minimal TANT expression, TANT networks.;
