Applications of Boolean Algebra Giuliano Donzellini, Domenico Ponta

Design of a programmable logic gate

 v1.71

Design a logic network acting as programmable logic gate. The network has four inputs A, B, F1, F0, and one output P. The output will take the value of the functions NAND, NOR, EXOR of A and B, accordingly to the combination of the control variables F1 and F0. The relation is:

 F1 F0 P 0 0 A nand B 1 0 A nor B 0 1 A exor B

Assume that the combination F1, F0 = 11 is never applied to the inputs. You are requested to produce the following items:

• the truth table;
• the K-Map of the function;
• the AND-OR boolean equation of the output (from the k-map);
• the network schematic.

Draw the schematic of the resulting network using the following schematic to be completed (click on the figure to open it in the d-DcS): First, check the correctness of your design using the functional simulation . When done, simulate the net also with the timing simulator . We suggest to use the test sequence shown below (available in the Timing Diagram window): 