The Community for Technology Leaders
RSS Icon
Issue No.10 - October (1972 vol.21)
pp: 1099-1108
J. Frackowiak , Department of Automation and Computer Science, Silesian Technical University
This paper presents a new algorithm A<sup>m</sup>for 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.
CC table, general implicant, head, modified CC table, prime permissible implicant, quasi-elementary implicant, static hazard, tail factors.
J. Frackowiak, "The Synthesis of Minimal Hazardless TANT Networks", IEEE Transactions on Computers, vol.21, no. 10, pp. 1099-1108, October 1972, doi:10.1109/T-C.1972.223456
18 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool