Five methods for simplification of logic function and comparison of their characteristics

Five methods for generating all prime implicants from any given function, especially shown by the sum form of minterms which is suitable to program processing using the LISP language for the symbolic process, are proposed. Their characteristics are compared by running their LISP programs on the LISP machine ELIS. As a result, it was proved that in general, but particularly for the higher numbers of variables, the operating time of the AMG-DIV (adjacent-minterms-groups plus its division) method was equal to that of the IONEX-DIV (improved consensus expansion) method and that the operating times of both methods were superior to those of the other methods.<<ETX>>