An efficient program for logic synthesis of mod-2 sum expressions

Resurrected interest in mod-2 sum logic requires efficient algorithms for synthesis of incompletely specified multiple-output functions. The authors report on a program based on new algorithms: Quasi-minimum covering is obtained in a polarized Reed-Muller domain using a modified disjoint sharp operator. Since a new algorithm for cubewise RMT is applied, and since no iterative procedures are employed, the program performs about an order of magnitude faster than other algorithms. The new program can handle functions of hundreds of variables on a personal computer. Solutions are (on average) superior to those of other methods.<>