Simplification of AND, EXCLUSIVE-OR Switching Function

摘要

The use of Exclusive-Or circuits often lead to significant circuit reduction. However, the minimization of circuits containing Exclusive-Or gates is quite different from the minimization of conventional And-Or circuits. In this paper, a simple tabular method has been presented for the near minimal realization of arbitrary Boolean function by networks composed of And and Exclusive-Or circuits.