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

Sik-Sang Yau, D. L. Ostapko

Research output: Contribution to journalArticle

4 Citations (Scopus)

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 - 1968
Externally publishedYes

Fingerprint

Threshold logic
Switching functions
Logic
Threshold Function
Class
Minimal Realization
Parity

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

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

Cite this

Realization of a Class of Switching Functions by Threshold-Logic Networks. / Yau, Sik-Sang; Ostapko, D. L.

In: IEEE Transactions on Computers, Vol. C-17, No. 4, 1968, p. 391-399.

Research output: Contribution to journalArticle

@article{508c1e4c31eb4c85ab23145bf3c0203b,
title = "Realization of a Class of Switching Functions by Threshold-Logic Networks",
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.",
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",
author = "Sik-Sang Yau and Ostapko, {D. L.}",
year = "1968",
doi = "10.1109/TC.1968.229390",
language = "English (US)",
volume = "C-17",
pages = "391--399",
journal = "IEEE Transactions on Computers",
issn = "0018-9340",
publisher = "IEEE Computer Society",
number = "4",

}

TY - JOUR

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

AU - Yau, Sik-Sang

AU - Ostapko, D. L.

PY - 1968

Y1 - 1968

N2 - 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.

AB - 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.

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

UR - http://www.scopus.com/inward/record.url?scp=44349087102&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=44349087102&partnerID=8YFLogxK

U2 - 10.1109/TC.1968.229390

DO - 10.1109/TC.1968.229390

M3 - Article

AN - SCOPUS:44349087102

VL - C-17

SP - 391

EP - 399

JO - IEEE Transactions on Computers

JF - IEEE Transactions on Computers

SN - 0018-9340

IS - 4

ER -