This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
October 1978 (vol. 27 no. 10)
pp. 961-966
H.A. Vink, Department of Electrical Engineering, Delft University of Technology
Gimpel has presented a minimization algorithm which realizes a minimal TANT network for any Boolean function, under a NAND gate cost criterion. Gimpel uses a covering closure (CC)-table and reduces this table with the reduction techniques of Grasselli and Luccio to find a least cost subset of implicants.
Index Terms:
reduction rules, CC-table, gate cost criterion, minimal TANT network, minimization
Citation:
H.A. Vink, B. Van Den Dolder, J. Al, "Reduction of CC-Tables Using Multiple Implication," IEEE Transactions on Computers, vol. 27, no. 10, pp. 961-966, Oct. 1978, doi:10.1109/TC.1978.1674976
Usage of this product signifies your acceptance of the Terms of Use.