This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
The Synthesis of Minimal Hazardless TANT Networks
October 1972 (vol. 21 no. 10)
pp. 1099-1108
J. Frackowiak, Department of Automation and Computer Science, Silesian Technical University
This paper presents a new algorithm Amfor the synthesis of minimum gate costs TANT networks. This algorithm, which differs in the setting up of the CC table from the known Gimpel's algorithm [1], has some very advantageous features, both in its hand solution and the computer realization. The final stage of this synthesis is the solution of the CC table.
Index Terms:
CC table, general implicant, head, modified CC table, prime permissible implicant, quasi-elementary implicant, static hazard, tail factors.
Citation:
J. Frackowiak, "The Synthesis of Minimal Hazardless TANT Networks," IEEE Transactions on Computers, vol. 21, no. 10, pp. 1099-1108, Oct. 1972, doi:10.1109/T-C.1972.223456
Usage of this product signifies your acceptance of the Terms of Use.