Abstract :
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.
Keywords :
CC table, general implicant, head, modified CC table, prime permissible implicant, quasi-elementary implicant, static hazard, tail factors.; Automation; Boolean functions; Circuit synthesis; Combinational circuits; Computer science; Costs; Hazards; Minimization methods; Network synthesis; Tail; CC table, general implicant, head, modified CC table, prime permissible implicant, quasi-elementary implicant, static hazard, tail factors.;
