An exact minimization algorithm for generalized Reed-Muller expressions

A generalized Reed-Muller expression (GRM) is obtained by negating some of the literals in a positive polarity Reed-Muller expression (PPRM). There are at most 2/sup n2(n-1)/ different GRMs for an n-variable function. A minimum GRM is one with the fewest products. This paper presents certain properties and an exact minimization algorithm for GRMs. The minimization algorithm uses binary decision diagrams. Up to five variables, all the representative functions of NP-equivalence classes were generated, and minimized. A table compares the number of products necessary to represent 5-variable functions for 7 classes of expressions: FPRMs, KROs, PSDRMs, PSD-KROs, GRMs, ESOPs, and SOPs. GRMs require, on the average, fewer products than sum-of-products expressions and have easily testable realizations.

[1]  D. Green.  Families of Reed-Muller canonical forms , 1991 .

[2]  David H. Green,et al.  Modern logic design , 1986 .

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

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

[5]  Martin Cohn.  Inconsistent Canonical Forms of Switching Functions , 1962, IRE Trans. Electron. Comput..

[6]  George K. Papakonstantinou.  Minimization of Modulo-2 Sum of Products , 1979, IEEE Transactions on Computers.

[7]  Sudhakar M. Reddy,et al.  Fault Detecting Test Sets for Reed-Muller Canonic Networks , 1975, IEEE Transactions on Computers.

[8]  M. Perkowski,et al.  Canonical restricted mixed-polarity exclusive-OR sums of products and the efficient algorithm for their minimisation , 1993 .

[9]  Marek A. Perkowski,et al.  Fast exact and quasi-minimal minimization of highly testable fixed-polarity AND/XOR canonical networks , 1992, [1992] Proceedings 29th ACM/IEEE Design Automation Conference.

[10]  Amar Mukhopadhyay,et al.  Minimization of Exclusive or and Logical Equivalence Switching Circuits , 1970, IEEE Transactions on Computers.

[11]  Tsutomu Sasao.  EXMIN2: a simplification algorithm for exclusive-OR-sum-of-products expressions for multiple-valued-input two-valued-output functions , 1993, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[12]  Randal E. Bryant,et al.  Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.

[13]  Marek A. Perkowski.  The generalized orthonormal expansion of functions with multiple-valued inputs and some of its applications , 1992, [1992] Proceedings The Twenty-Second International Symposium on Multiple-Valued Logic.

[14]  Marek Perkowski,et al.  Design For Testability Properties of AND/XOR Networks , 1993 .

[15]  Marek A. Perkowski,et al.  Fast minimization of mixed-polarity AND/XOR canonical networks , 1992, Proceedings 1992 IEEE International Conference on Computer Design: VLSI in Computers & Processors.

[16]  Tsutomu Sasao.  Easily testable realizations for generalized Reed-Muller expressions , 1994, Proceedings of IEEE 3rd Asian Test Symposium (ATS).