An algorithm for the multi-level minimization of Reed-Muller representations

There is interest currently in using Reed-Muller equations as a way of representing and manipulating switching functions, and as a means of designing circuits based on exclusive-OR gates. There are only two-level Reed-Muller minimizers in use, although the need for a multi-level minimizer has been identified. A procedure for multi-level Reed-Muller minimization has been developed. It introduces a Reed-Muller factored form and uses algebraic algorithms for factorization decomposition, resubstitution, collapsing, and extraction of common cubes and sub-expressions. The procedure has been implemented in C as a series of packages which have been added to MISII, and benchmark comparisons with minimal two-level representations are favorable.<<ETX>>

[1]  Robert K. Brayton,et al.  Multilevel logic synthesis , 1990, Proc. IEEE.

[2]  Tsutomu Sasao,et al.  On the complexity of mod-2l sum PLA's , 1990 .

[3]  SUDHAKAR M. REDDY,et al.  Easily Testable Realizations ror Logic Functions , 1972, IEEE Transactions on Computers.

[4]  J. M. Saul.  An improved algorithm for the minimization of mixed polarity Reed-Muller representations , 1990, Proceedings., 1990 IEEE International Conference on Computer Design: VLSI in Computers and Processors.

[5]  Shimon Even,et al.  On Minimal Modulo 2 Sums of Products for Switching Functions , 1967, IEEE Trans. Electron. Comput..

[6]  Marek A. Perkowski,et al.  A fast algorithm to minimize multi-output mixed-polarity generalized Reed-Muller forms , 1988, DAC '88.

[7]  E. B. Pitty,et al.  Input irredundancy of mixed-polarity Reed-Muller equations , 1988 .