THE analysis and synthesis of 2-terminal combinational networks from the standpoint of truth tables and Boolean algebra have been treated in great detail.1,2 In this paper these networks will be considered from a somewhat different viewpoint, mainly a switching function will be considered as a set of Vertexes on an n-dimensional cube (n-cube). Once a correspondence between a switching function and a set of Vertexes on an n-cube is found, the concept of a ¿distance¿ may then be introduced. This concept proves to be of value in the problems of discovering symmetries and of classifying types of switching functions.

+More

analysis classifying types of switching functions synthesis of 2terminal combinational networks ncube discovering symmetries switching function truth tables distance boolean algebra ndimensional cube vertexes

Lee, C. Y.,.Switching functions on an n-dimensional cube. 73 (4),289-291.

Lee, C. Y.,"Switching functions on an n-dimensional cube" 73

Lee, C. Y.,"Switching functions on an n-dimensional cube"