New methods of simplifying Boolean functions

ECONOMY IS ONE of the most important considerations in the design of any system. Maximum savings can be achieved in the design of switching circuits by performing the desired logic in the simplest minimum form applicable to the equipment utilized. Boolean algebra is often used to express the functions of switching circuits and these Boolean expressions generally appear in the final form of a sum of products or a product of sums. The form that presents the most economical application is determined by the equipment. It is therefore necessary to be able to transform and simplify Boolean functions so that they will appear in the predetermined form that will yield the maximum savings.