The Community for Technology Leaders
Green Image
Issue No. 11 - November (1978 vol. 27)
ISSN: 0018-9340
pp: 1073-1078
H.A. Vink , 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.
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. , pp. 1073-1078, November 1978, doi:10.1109/TC.1978.1675000
98 ms
(Ver )