Transactions of the I R E Professional Group on Electronic Computers · 1954 · 646 citations · 0 references
The mathematical treatment of the problem applies only to circuits that may be represented by “polynomials” in Boolean algebra. The study seeks a solution to simplifying switching circuits with more than one output. The authors describe computer‑friendly techniques for simplifying Boolean “+polynomials” using exclusive‑or operations, tested on the Illiac. The study demonstrates that parts of the multi‑output problem can be reduced to a single‑output problem with inputs equal to the total of original inputs and outputs, that a simple reduction exists for two outputs, and that a metric relationship among “+polynomial” nets can be exploited to construct error‑detecting codes when the code length is a power of two.
A solution is sought to the general problem of simplifying switching circuits that have more than one output. The mathematical treatment of the problem applies only to circuits that may be represented by "polynomials" in Boolean algebra. It is shown that certain parts of the multiple output problem for such circuits may be reduced to a single output problem whose inputs are equal in number to the sum of the numbers of inputs and outputs in the original problem. A particularly simple reduction may be effected in the case of two outputs. Various techniques are described for simplifying Boolean expressions, called "+ polynomials," in which the operation "exclusive or" appears between terms. The methods described are particularly suitable for use with an automatic computer, and have been tested on the Illiac. An unexpected metric relationship is shown to exist between the members of certain classes of "+ polynomials" called "nets." This relationship may be used for constructing error-detecting codes, provided the number of bits in the code is a power of two.