Realization of Switching Functions

· Conversion of Switching Functions to Logic Diagrams

Steps

1) Switching function.

2) Reduce redundant terms in the switching function.

3) Convert switching functions considering functions present in the functionally complete operation set.

Example

OR, NOT, AND

1) G = X’Y’Z’ + XY’Z + X’YZ’ + XYZ

= X’Z’ + XZ

2) H = (X + Y’+ Z)(X’ + Y + Z)

By reduction:

H = (X +Y’ + Z)(X’ + Y + Z)

= XX’ + X’Y’ + X’Z + XY + YY’ + YZ + XZ +Z’Y + ZZ

= (X + X’)Z + Y(Z + Z’) + Z + XY + X’Y’

= Z + Y + XY + X’Y’

= Z + Y + X’Y’