The Community for Technology Leaders
Green Image
Issue No. 10 - October (1978 vol. 27)
ISSN: 0018-9340
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.
reduction rules, CC-table, gate cost criterion, minimal TANT network, minimization

J. Al, H. Vink and B. Van Den Dolder, "Reduction of CC-Tables Using Multiple Implication," in IEEE Transactions on Computers, vol. 27, no. , pp. 961-966, 1978.
88 ms
(Ver 3.3 (11022016))