Thumbnail
Access Restriction
Subscribed

Author Chu, J. T.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©1961
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Abstract Several methods for simplifying switching circuits using “don't-care” conditions are suggested. One of the methods uses the following procedure: Let the given circuit be represented by the truth function $\textit{F}.$ Let the given “don't-care” conditions be denoted $by\textit{D}$ = 0. (For example, if $\textit{x}1$ = 1 and $\textit{x}2$ = 0 represent the combination of input signals which never takes place, then $\textit{D}$ = $\textit{x}1\textit{x}2.)$ Generate all the irredundant disjunctive and conjunctive forms which are equivalent $to\textit{F}$ $whenever\textit{D}$ = 0. From these forms, the simplest ones may then be chosen according to a given measure of simplicity. They correspond to the simplest two-level AND/OR or OR/AND switching circuits which, under the “don't-care” conditions, perform the same function as the given circuit. Several methods for generating the equivalent irredundant forms are suggested. They are generalizations of those due to Quine, Ghazala and Mott, and may be programmed for use on computers. Alternative simplification methods are also given.
ISSN 00045411
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1961-10-01
Publisher Place New York
e-ISSN 1557735X
Journal Journal of the ACM (JACM)
Volume Number 8
Issue Number 4
Page Count 16
Starting Page 497
Ending Page 512


Open content in new tab

   Open content in new tab
Source: ACM Digital Library