Truth Tables to Logic Expressions



Download 127.73 Kb.
Page2/2
Date17.12.2020
Size127.73 Kb.
#55420
1   2
2.1.1.a aoitruthtablestologicexpressions(finished)
Procedure

Before we tackle the more challenging aspects of translating a written specification into a truth table, let’s take a look at the process of writing an un-simplified logic expression from a completed truth table.



Example:




A

B

Z

Minterms







0

0

0







0

1

1






1

0

1






1

1

0











Using the above example (previous page) as a guide, write the un-simplified logic expression for each of the following truth tables. Though it is not required, you may find it helpful to first write the Minterm expression for every place containing a one in the output function.

1.

M

N

F1

0

0

1

0

1

0

1

0

0

1

1

1




2.

X

Y

F2

0

0

1

0

1

0

1

0

1

1

1

1




5.

W

X

Y

Z

F5

0

0

0

0

0

0

0

0

1

0

0

0

1

0

1

0

0

1

1

0

0

1

0

0

1

0

1

0

1

1

0

1

1

0

0

0

1

1

1

0

1

0

0

0

0

1

0

0

1

0

1

0

1

0

1

1

0

1

1

0

1

1

0

0

1

1

1

0

1

0

1

1

1

0

1

1

1

1

1

0


F1 = M’N’+MN




F2 = X’Y’+XY’+XY



3.

P

Q

R

F3

0

0

0

0

0

0

1

1

0

1

0

0

0

1

1

0

1

0

0

1

1

0

1

0

1

1

0

1

1

1

1

0




4.

J

K

L

F4

0

0

0

0

0

0

1

1

0

1

0

0

0

1

1

1

1

0

0

1

1

0

1

0

1

1

0

0

1

1

1

1



F3 =P’Q’R+PQ’R’+PQR’


F4 =J’K’L+J’KL+JK’L’+JKL





F5 =W’X’YZ’+W’XY’Z’+WX’YZ’+WXY’Z’+WXYZ’



Now that you have mastered the process of writing an un-simplified logic expression from a completed truth table, let’s reverse the process. For the following logic expressions, create a corresponding truth table. Note that some terms in the logic expression may map to more than one place in the truth table.

  1. 

C

D

F







0

0

1







0

1

1







1

0

0







1

1

0









  1. 

R

S

T

F2

0

0

0

1

0

1

0

1

1

0

1

1

0

1

1

0

1

1

0

0

1

1

1

1





A

B

C

F3

0

0

0

1

0

1

0

1

1

0

0

1

0

0

1

0

1

1

0

0

0

1

1

0

1

0

1

1

1

1

1

1



Now that you understand the mechanics of converting from a truth table to a logic expression (and vice-versa), let’s revisit a circuit design we were introduced to in Unit 1. Your new car has an audio alarm that buzzes whenever the door is open and the key is in the ignition or when the key is in the ignition and the seatbelt is not buckled.
NOTE: This seatbelt alarm design is slightly different than the one you created earlier.

  1. Using the following variable names and assignment conditions:

Complete the truth table shown below that captures the functionality of this audio alarm.

  • D: Door → 0=Door Open / 1=Door Close

  • K: Key → 0=Key Not in Ignition / 1=Key in Ignition

  • S: Seat → 0=Not Buckled / 1=Buckled

  • B: Buzzer → 0=Buzzer Off / 1=Buzzer On




D

K

S

B

(Door)

(Key)

(Seat Belt)

(Buzzer)

0

0

0

0

0

0

1

0

0

1

0

1

0

1

1

1

1

0

0

0

1

0

1

0

1

1

0

1

1

1

1

0










  1. Using the truth table you just created, write the un-simplified logic expression for the buzzer (i.e., variable B). Be sure that your answer is in the Sum-of-Products form.

B= D’KS’+D’KS+DKS’

In a future activity, you will see that this logic expression can be simplified to:





Note: Some of you may have been able to extract this simplified logic expression directly from the specifications. If so, you may be asking yourself, why did I have to go through the process of creating the truth table and writing the un-simplified logic expression first? This was a simple problem. As you progress through this class, the design problems will become more difficult The process that you are learning now will become invaluable in solving more challenging problems.

Your Aunt Mary would like you to design a digital logic circuit that monitors the conditions in a room of her house where her seven cats live. The room’s temperature is monitored by a temperature sensor. The room’s humidity is monitored by a humidity sensor. The air quality of the room is monitored by a special sensor that measures air particle density. The three sensors output a one (1) to indicate an out-of-range condition. Located outside of the room is an ALERT light that is on (1) whenever two or more sensors are out-of-range.




  1. Create a truth table that captures the functionality of this room monitoring system.



T

H

A

L

0

0

0

0

1

0

0

0

0

0

1

0

0

1

0

0

1

1

0

1

0

1

1

1

1

0

1

1

1

1

1

1



  1. Using the truth table that you just created, write the un-simplified logic expression for the ALERT light. Be sure that your answer is in the Sum-of-Products form.

L= THA’+T’HA+TH’A+THA






Conclusion

A digital logic circuit with (2) inputs has (4) input combinations. One with (3) inputs has (8) combinations. One with (4) inputs has (16) combinations.



  1. How many input combinations would a digital logic circuit have if it has (5) inputs?
    How about (6) inputs?

5 inputs = 32 combinations

6 inputs= 64 combinations



  1. Mathematically express the relationship between the number of input (N) and the number of input combinations (C).

2n=C

  1. Write the un-simplified logic expression for the truth table shown below.



X

Y

Z

0

0

1

0

1

1

1

0

1

1

1

1

Z= X’Y’+X’Y+XY’+XY

Did you see the short cut? (Hint: Z is always a one.)

Going Further – Optional

The un-simplified logic expression for the truth table shown below is;






A

B

C

0

0

1

0

1

1

1

0

0

1

1

1
Another way to write this would be .

Explain why this is true.

This would be true because C = 0 when A=1 and B=0.




© 2014 Project Lead The Way, Inc.

Digital Electronics Activity 2.1.1 AOI Design: Truth Tables to Logic Expressions – Page



Download 127.73 Kb.

Share with your friends:
1   2




The database is protected by copyright ©ininet.org 2024
send message

    Main page