Presentation is loading. Please wait.

Presentation is loading. Please wait.

Constructing A Truth Table XYZF1F1 0 1 0 1 1 0 1 0 InputsOutput Input Combinations 3 – Inputs 8 – Combinations (8 = 2 3 ) Note the binary counting order.

Similar presentations


Presentation on theme: "Constructing A Truth Table XYZF1F1 0 1 0 1 1 0 1 0 InputsOutput Input Combinations 3 – Inputs 8 – Combinations (8 = 2 3 ) Note the binary counting order."— Presentation transcript:

1 Constructing A Truth Table XYZF1F1 0 1 0 1 1 0 1 0 InputsOutput Input Combinations 3 – Inputs 8 – Combinations (8 = 2 3 ) Note the binary counting order of the inputs : 000 2 = 0 10 001 2 = 1 10 010 2 = 2 10 011 2 = 3 10 100 2 = 4 10 101 2 = 5 10 110 2 = 6 10 111 2 = 7 10 Outputs for Each Input Combination 1

2 Example Truth Tables ABF2F2 000 010 100 111 XYZF3F3 0000 0011 0100 0111 1000 1011 1100 1110 RSTUF4F4 00000 00011 00100 00111 01001 01010 01100 01110 10001 10010 10100 10111 11001 11010 11100 11111 3 Inputs 2 3 = 8 Combinations 4 Inputs 2 4 = 16 Combinations 2 Inputs 2 2 = 4 Combinations 2

3 Truth Table to Logic Expression Write the Minterm adjacent to every row in the truth table that contains a one in the output column. Write the Sum-Of-Products (SOP) logic expression by summing together all of the Minterms. Example Write the SOP logic expression for the output F 5 in the truth table below. XYZF5F5 0000 0011 0100 0111 1001 1010 1101 1110 3


Download ppt "Constructing A Truth Table XYZF1F1 0 1 0 1 1 0 1 0 InputsOutput Input Combinations 3 – Inputs 8 – Combinations (8 = 2 3 ) Note the binary counting order."

Similar presentations


Ads by Google