Synthesis of TANT networks using a Boolean analyser
Miguel Alejandro Marin · The Computer Journal · 1969
The automated synthesis of TANT combinational networks (Three-level AND-NOT networks with True inputs) is studied using the advantages of Svoboda Boolean Analyzer (SBA) (see Svoboda, 1968). The synthesis procedure consists of (i) calculating the ordinary prime implicants of the given function f using operation Mode I of SBA, (ii) calculation of all generalised prime implicants of f by solving a system of Boolean equations (operation Mode II), (iii) solution of a covering problem using a special Petrick function and operation Mode I of the SBA. The synthesis procedure yields a TANT network containing a minimum number of AND-NOT elements. FORTRAN IV programs have been developed which implement the proposed synthesis method; however, the SBA hardware unit, when available, will prove an efficiency factor in processing time of approximately 104.