The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.10 - October (1978 vol.27)
pp: 961-966
H.A. Vink , Department of Electrical Engineering, Delft University of Technology
ABSTRACT
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, October 1978, doi:10.1109/TC.1978.1674976
25 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool