Switching function canonical forms based on commutative and associative binary operations: The switching function

Peter Calingaert · Transactions of the American Institute of Electrical Engineers Part I Communication and Electronics · 1961

It is often convenient to consider the arguments of a switching function to be the components zero or 1 of a vector. It is appropriate, therefore, to employ a vector notation for the theory of switching. The notation developed by Iverson1 for the study of automatic data processing is admirably suited, with a few modifications, to the theory of switching as well. Those features of the Iverson notation that are appropriate have been adapted for the present discussion, and are set forth below.

Read the paper · More papers on PaperTik