Realization of a Class of Switching Functions by Threshold-Logic Networks

S. S. Yau, D. L. Ostapko

Research output: Contribution to journalArticle

4 Scopus citations

Abstract

Inthis note, 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 constrained solutions for 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.

Original languageEnglish (US)
Pages (from-to)391-399
Number of pages9
JournalIEEE Transactions on Computers
VolumeC-17
Issue number4
DOIs
StatePublished - Apr 1968
Externally publishedYes

    Fingerprint

Keywords

  • Economical and minimal threshold-logic realizations constrained solutions techniques and properties parity functions switching functions threshold-logic networks threshold-product functions threshold-sum functions

ASJC Scopus subject areas

  • Software
  • Theoretical Computer Science
  • Hardware and Architecture
  • Computational Theory and Mathematics

Cite this