DIGITAL LOGIC DESIGN

Boolean Algebra and Logic Gates 1

 Basic Operations
 COMPLEMENT (INVERSE)

' '
0  1 and 1  0
' '
A  1 if A  0 and A  0 if A  1

0 is low voltage
1 is high voltage

Boolean Algebra and Logic Gates 2

 Basic Operations
 AND

F is 1 if and only if
A and B are both 1

Boolean Algebra and Logic Gates 3

 Basic Operations
 OR

F is 1 if and only if
A or B (or both) are 1

Boolean Algebra and Logic Gates 4

 Logic Gates

COMBINATIONAL GATES
Name Symbol Function Truth Table
A B X
A X=A•B 0 0 0
AND X or 0
1
1
0
0
0
B X = AB 1 1 1
A B X
A 0 0 0
OR X X=A+B 0 1 1
1 0 1
B 1 1 1
A X
I A X X = A’
0
1
1
0
A X
0 0
Buffer A X X=A 1 1
A B X
A 0 0 1
NAND X X = (AB)’
0
1
1
0
1
1
B 1 1 0
A B X
A 0 0 1
NOR X X = (A + B)’ 0
1
1
0
0
0
B 1 1 0
A B X
A X=AB
XOR X or
0
0
0
1
0
1
Exclusive OR 1 0 1
B X = A’B + AB’
1 1 0
A B X
A X = (A  B)’
XNOR X or
0
0
0
1
1
0
Exclusive NOR
B X = A’B’+ AB 1 0 0
or Equivalence 1 1 1
Basic Theorems

Let’s prove each one

6
Truth Table
 It can represent a boolean function
 For possible input combinations it
shows the output value
n
 There are 2 rows (n is the number of
input variables)
n
 It ranges from 0 to  1
2

7
 Truth Tables
 Truth table  a tabular listing of the values of a
function for all possible combinations of
values on its arguments
 Example: Truth tables for the basic logic
operations:
AND OR NOT
X YZ = X·Y X Y Z = X+Y X ZX
0 0 0 0 0 0 0 1
0 1 0 0 1 1 1 0
1 0 0 1 0 1
1 1 1 1 1 1
Chapter 2 - Part 1 8
Examples
 Show the truth table for

'
F  X  YZ
 Show the followings by constructing
truth tables
X (Y  Z )  XY  XZ
X  YZ  ( X  Y )( X  Z )

9
Example
 Draw the network diagram for

'
F  X  YZ

10
Example
 Draw the network diagram for
' ' ' '
F  XYZ  XY Z  X Y

11
Operator Precedence
 Parenthesis
 NOT
 AND
 OR

12
Study Problems
1. Draw a network to realize the following by using
only one AND gate and one OR gate
Y  ABCD  ABCE  ABCF
2. Draw a network to realize the following by using
two OR gates and two AND gates
F  (V  W  X )(V  X  Y )(V  Z )
3. Prove the following equations using truth table

W ' XY  WZ  (W '  Z )(W  XY )

( A  C )( AB  C ' )  AB  AC '
13
 Solution of problem 2
L.H.S.=(V+X+W)(V+X+Y)(V+Z)
=[(V+X)+W(V+X)+Y(V+X)+WY](V+Z)
=[(V+X)(1+W+Y)+WY](V+Z)
=(V+X+WY)(V+Z)
This can be implemented by two OR
gates and two AND gate.

Boolean Algebra and Logic Gates 14