Application of Boolean Algebra

Giuliano Donzellini, Domenico Ponta

Minimized synthesis of a boolean function

015080

 

v1.71

Synthesize, using a Karnaugh Map, the Boolean function described by the following table:

X
Y
Z
T
F
0
0
0
0
1
0
0
0
1
1
0
0
1
0
1
0
0
1
1
0
0
1
0
0
0
0
1
0
1
0
0
1
1
0
0
0
1
1
1
1
1
-
-
-
1

Compile the K-Map. Synthesize the network described by the map and write the AND-OR boolean expression of F = f(X,Y,Z,T).

Open the d-DcS and draw the network's schematic, using the following template (click on the figure):

Once completed the schematic, simulate the network with the timing simulator . We suggest to use the test sequence shown below (available in the Timing Diagram window):