Canonical restricted mixed-polarity exclusive sums of products

Author

Csanky, Laszlo ; Perkowski, Marek ; Schaefer, Ina

Author_Institution

Portland State Univ., OR, USA

Volume

1

fYear

1992

fDate

10-13 May 1992

Firstpage

17

Abstract

The concept of canonical restricted mixed polarity (CRMP) exclusive sum of products (ESOP) forms is introduced. It includes the inconsistent canonical Reed-Muller and generalized Reed-Muller forms as special cases. The set of CRMP forms is included in the set of ESOP expressions. An attempt to characterize minimal CRMP forms for completely specified Boolean functions is presented, as well as an attempt to gain insight into the complexity of computation needed to find such a form. Some fundamental properties unique to CRMPs are proved. It is also proved that the upper bound on the number of terms in the CRMP form is smaller than that in the conventional normal forms and is equal to that of the ESOPs. A theorem providing a lower bound on the number of CRMP terms is also given. These results prove the validity of the CRMP concept. An efficient generic heuristic algorithm to find the CRMP form is presented

Keywords

Boolean functions; logic design; logic gates; Boolean functions; CRMP terms; ESOPs; Reed-Muller forms; canonical restricted mixed polarity; exclusive sum of products; generic heuristic algorithm; lower bound; upper bound; validity; Boolean functions; Circuit testing; Computer science; Field programmable gate arrays; Heuristic algorithms; Input variables; Logic gates; Programmable logic arrays; Synthesizers; Upper bound;

fLanguage

English

Publisher

ieee

Conference_Titel

Circuits and Systems, 1992. ISCAS '92. Proceedings., 1992 IEEE International Symposium on

Conference_Location

San Diego, CA

Print_ISBN

0-7803-0593-0

Type

conf

DOI

10.1109/ISCAS.1992.230025

Filename

230025