The Synthesis of Minimal Hazardless TANT Networks

This paper presents a new algorithm A
^m
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.