This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Minimal TANT Networks of Functions with DON'T CARE'S and Some Complemented Input Variables
November 1978 (vol. 27 no. 11)
pp. 1073-1078
H.A. Vink, Department of Electrical Engineering, Delft University of Technology
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.
Index Terms:
gate cost criterion, DON'T CARE'S, implicants, invertors, minimization
Citation:
H.A. Vink, "Minimal TANT Networks of Functions with DON'T CARE'S and Some Complemented Input Variables," IEEE Transactions on Computers, vol. 27, no. 11, pp. 1073-1078, Nov. 1978, doi:10.1109/TC.1978.1675000
Usage of this product signifies your acceptance of the Terms of Use.