학술논문
Reduction of CC-Tables Using Multiple Implication
Document Type
Periodical
Author
Source
IEEE Transactions on Computers IEEE Trans. Comput. Computers, IEEE Transactions on. C-27(10):961-966 Oct, 1978
Subject
Language
ISSN
0018-9340
1557-9956
2326-3814
1557-9956
2326-3814
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.