Next: Other ways of realizing Up: Digital Circuits Previous: Using NAND gates   Contents

# Boolean Expressions

A general realization of a Boolean expression is shown in 12.15

Example:
In a car, we have the following components:
A
Day-night sensor: Day-1, Night-0
B
Lamps on: On-1, Off-0
C
Ignition on: On-1, Off-0
D
Warning light for lamps-on
In this case, the truth table for the logic D would be
 A B C D 0 0 0 0 0 0 1 1 0 1 0 1 0 1 1 0 1 0 0 0 1 0 1 0 1 1 0 1 1 1 1 1

Therefore, , which can be written as in the sum of product form. We arrive at this by looking at the combinations when the outout is one.

We can alternatively, express this in the product of sums form by looking at the combinatins when the outout is low as

Using SOP and POS, it can be implemented as follows:

Next, we will try to reduce the number of gates by combining terms suitably.

We can get the above by clubbing the s in the k-map shown.

Now, if we club the zeroes together in the k-map,

Check that we get the same expression by simplifying the product of sums expression (by using (X+Y)(X+Z)=X+YZ)

Multiplexer

The truth table for the multiplexer is as follows:
 0 0 0 1 1 0 1 1

Next: Other ways of realizing Up: Digital Circuits Previous: Using NAND gates   Contents
ynsingh 2007-07-25