Given the following truthtable describing a boolean function F(X,Y,Z):
X

Y

Z

F

0

0

0

1

0

0

1

0

0

1

0

0

0

1

1

1

1

0

0

0

1

0

1

1

1

1

0

1

1

1

1

0

Synthesize the combinational function with two functionally equivalent networks: the first one realized as sum of products (ANDOR) and the second one as product of sums (ORAND). To verify the equivalence of the two networks, draw them in the dDcS. A schematic template is available (click on the figure to open it in the dDcS):
Perform a timing simulation of the two nets, including all possible combinations of the inputs X, Y and Z (a suitable test sequence is available in the Timing Diagram window).
