Title :
Minimal TANT Networks of Functions with DON´T CARE´S and Some Complemented Input Variables
Author_Institution :
Department of Electrical Engineering, Delft University of Technology
Abstract :
The minimization algorithm of Gimpel realizes a minimal TANT network for any Boolean function under a NAND gate cost criterion. A TANT network is a three-level network composed of AND-NOT (i.e., NAND) gates, having only true (i.e., uncomplemented) input variables.
Keywords :
DON´T CARE´S; gate cost criterion; implicants; invertors; minimization; Circuit faults; Circuit testing; Costs; Electrical fault detection; Electrons; Fault detection; Input variables; Multivalued logic; Notice of Violation; Sequential analysis; DON´T CARE´S; gate cost criterion; implicants; invertors; minimization;
Journal_Title :
Computers, IEEE Transactions on
DOI :
10.1109/TC.1978.1675000
