Accession Number : AD0646012

Title :   REALIZATION OF A CLASS OF SWITCHING FUNCTIONS BY THRESHOLD-LOGIC NETWORKS.

Descriptive Note : Technical rept.,

Corporate Author : NORTHWESTERN UNIV EVANSTON ILL INFORMATION-PROCESSING AND CONTROL SYSTEMS LAB

Personal Author(s) : Yau,Sik S. ; Ostapko,Daniel L.

Report Date : JAN 1967

Pagination or Media Count : 39

Abstract : A class of switching functions, called threshold-product functions, whose definition is analogous to that of threshold functions (which will be called threshold-sum functions), is studied in detail. It is shown that both threshold functions and parity functions are special cases of threshold-product functions. A simple and economical threshold-logic realization method is established for threshold-product functions. This economical realization method is based on a constrained solutions of threshold-product functions. A systematic technique for finding a constrained solution for a threshold-product function is obtained, and this technique can be employed for testing whether a switching function is a threshold-product function as well. When the number of variables in a switching function is not large, say no more than 6, a simpler method for the above purposes is found. Furthermore, a threshold-logic realization method which yields a minimal realization for certain threshold-product functions is obtained. (Author)

Descriptors :   (*COMPUTER LOGIC, *SWITCHING CIRCUITS), (*SPECIAL FUNCTIONS(MATHEMATICAL), SWITCHING CIRCUITS), THEOREMS, SYNTHESIS

Subject Categories : Numerical Mathematics

Distribution Statement : APPROVED FOR PUBLIC RELEASE