Minimal TANT Networks of Functions with DON'T CARE'S and Some Complemented Input Variables
作者： Vink
关键词:
摘要: The minimization algorithm of Gimpel realizes a minimal TANT network for any Boolean function under NAND gate cost criterion. A is three-level composed AND-NOT (i.e., NAND) gates, having only true uncomplemented) input variables.
sci-hub.se 参考文章(13)
Donald D. Givone, Introduction to switching circuit theory ,(1970)
S. Yajima, K. Inagaki, Power Minimization Problems of Logic Networks IEEE Transactions on Computers. ,vol. 23, pp. 153- 165 ,(1974) , 10.1109/T-C.1974.223878
K.K. Chakrabarti, A.K. Choudhury, M.S. Basu, Complementary Function Approach to the Synthesis of Three-Level NAND Network IEEE Transactions on Computers. ,vol. C-19, pp. 509- 514 ,(1970) , 10.1109/T-C.1970.222968
Edward J. McCluskey, Introduction to the theory of switching circuits ,(1965)
S.Y.H. Su, Chong-Woo Nam, Computer-Aided Synthesis or Multiple-Output Multilevel NAND Networks witk Fan-in and Fan-out Constraints IEEE Transactions on Computers. ,vol. C-20, pp. 1445- 1455 ,(1971) , 10.1109/T-C.1971.223156
Vink, Van Den Dolder, Al, Reduction of CC-Tables Using Multiple Implication IEEE Transactions on Computers. ,vol. 27, pp. 961- 966 ,(1978) , 10.1109/TC.1978.1674976
A. Grasselli, F. Luccio, A Method for Minimizing the Number of Internal States in Incompletely Specified Sequential Networks IEEE Transactions on Electronic Computers. ,vol. EC-14, pp. 350- 359 ,(1965) , 10.1109/PGEC.1965.264140
J. Frackowiak, The Synthesis of Minimal Hazardless TANT Networks IEEE Transactions on Computers. ,vol. C-21, pp. 1099- 1108 ,(1972) , 10.1109/T-C.1972.223456
D. T. Ellis, A Synthesis of Combinational Logic with NAND or NOR Elements IEEE Transactions on Electronic Computers. ,vol. EC-14, pp. 701- 705 ,(1965) , 10.1109/PGEC.1965.264209
James F. Gimpel, The Minimization of TANT Networks IEEE Transactions on Electronic Computers. ,vol. EC-16, pp. 18- 38 ,(1967) , 10.1109/PGEC.1967.264603