DIGITAL LOGIC DESIGN

by

Dr. Fenghui Yao

Tennessee State University

Department of Computer Science
Nashville, TN

Boolean Algebra and Logic Gates 1

 Definitions
 Switching network
 One or more inputs
 One or more outputs
 Two Types
 Combinational
 The output depends only on the
present values of the inputs
 Logic gates are used
 Sequential
 The output depends on present
and past input values
Boolean Algebra and Logic Gates 2
 Boolean Algebra

.
Inputs
.
.
Network . Outputs
.
.

 Boolean Algebra is used to describe the

relationship between inputs and outputs
 Boolean Algebra is the logic
mathematics used for understanding of
digital systems

Boolean Algebra and Logic Gates 3

 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 4

 Basic Operations
 AND

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

Boolean Algebra and Logic Gates 5

 Basic Operations
 OR

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

Boolean Algebra and Logic Gates 6

 Basic Theorems

Let’s prove each one

Boolean Algebra and Logic Gates 7
 Simplification Theorems
'
1. XY  XY  X
'
2. ( X  Y )( X  Y )  X
3. X  XY  X
4. X (X Y)  X
'
5. ( X  Y )Y  XY
'
6. XY  Y  X  Y
Boolean Algebra and Logic Gates 8
  Proof 6.
R.H.S. = X+Y
= X(Y+Y’)+Y(X+X’)
= XY+XY’+XY+X’Y
= XY+XY’+X’Y
= (X+X’)Y+XY’
= Y+XY’
= L.H.S.

Boolean Algebra and Logic Gates 9

 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

Boolean Algebra and Logic Gates 10

 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 )

Boolean Algebra and Logic Gates 11

 Example
 Draw the network diagram for

'
F  X  YZ

Boolean Algebra and Logic Gates 12

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

Boolean Algebra and Logic Gates 13

 Operator Precedence
 Parenthesis
 NOT
 AND
 OR

Boolean Algebra and Logic Gates 14

 Inversion
( X  Y ) '  X 'Y ' Prove with the
truth tables…
( XY ) '  X '  Y '
' ' ' '
( X 1  X 2  ...  X n )  X X ... X1 2 n
' ' ' '
( X 1 X 2 ... X n )  X  X  ...  X
1 2 n

 The complement of the product is the sum of the

complements
 The complement of the sum is the product of the
complements

Boolean Algebra and Logic Gates 15

 Examples
 Find the complements of
' ' '
[( A  B )C ]  ?
' ' '
[( AB  C ) D  E ]  ?
A  (( BC ) ' '
 D) 
' ''
?

Boolean Algebra and Logic Gates 16

 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 '
Boolean Algebra and Logic Gates 17
 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 18

 Minterms
 Consider variables A and B
 Assume that they are somehow combined
with AND operator
 There are 4 possible combinations

AB, A' B , AB ' , A' B '

 Each of those terms is called a minterm

(standard product)
n
 In general, if there are n variables, there are 2
minterms

Boolean Algebra and Logic Gates 19

 Exercise
 List the minterms for 3 variables

A B C Minterm Designation
0 0 0 A ' B ' C' m0

0 0 1 A'B'C m1

0 1 0 A ' B C' m2

0 1 1 A'B C m3

1 0 0 A B ' C' m4

1 0 1 A B'C m5

1 1 0 A B C' m6

1 1 1 A B C m7

Boolean Algebra and Logic Gates 20

 Maxterms
 Consider variables A and B
 Assume that they are somehow combined with
OR operator
 There are 4 possible combinations

A  B, A'  B, A  B' , A'  B '

 Each of those terms is called a maxterm

(standard sums)
n
 In general, if there are n variables, there are 2
maxterms

Boolean Algebra and Logic Gates 21

 Exercise
 List the maxterm for 3 variables

A B C Maxterm Designation
0 0 0 A+B+C M0

0 0 1 A+B+C' M1

0 1 0 A+B'+C M2

0 1 1 A+B'+C' M3

1 0 0 A'+B+C M4

1 0 1 A'+B+C' M5

1 1 0 A'+B'+C M6

1 1 1 A'+B'+C' M7

Boolean Algebra and Logic Gates 22

 Example
 Express F in the sum of minterms and
product of maxterms formats
'
F  A  BC
F  A  BC '  A( B  B ' )(C  C ' )  ( A  A' ) BC '
 ABC  ABC '  AB 'C  AB 'C '  ABC '  A' BC '
 ABC  ABC '  AB 'C  AB 'C '  A' BC '
 m7  m6  m5  m4  m2
  2,4,5,6,7 
 0,1,3
Boolean Algebra and Logic Gates 23
 Sum-of-Products
 All products are the product of single
variable only

' ' ' '

AB  CD E  AC E YES
' '
A B C  D E YES
( A  B )CD  EF NO

Boolean Algebra and Logic Gates 24

 Sum-of-Products
 One or more AND gates feeding a
single OR gate at the output

' ' ' '

AB  CD E  AC E
A
B'
C
D'
E
A
C'
E'
Boolean Algebra and Logic Gates 25
 Product-of-Sums
 All sums are the sums of single
variables

' ' ' '

( A  B )(C  D  E )( A  C  E ) YES
' '
AB C ( D  E ) YES
( A  B )(C  D)  EF NO

Boolean Algebra and Logic Gates 26

 Product-of-Sums
 One or more OR gates feeding a single
AND gate at the output

( A  B ' )(C  D '  E )( A  C '  E ' )

A
B'
C
D'
E
A
C'
E'

Boolean Algebra and Logic Gates 27

 Logic Gates

F  A B F  A B

Boolean Algebra and Logic Gates 28

 Exclusive-OR
A0  A
A  1  A'
A A  0
A  A'  1
A B  B  A
( A  B)  C  A  ( B  C )  A  B  C
A( B  C )  AB  AC
( A  B) '  A  B '  A'  B  AB  A' B '

A  B  1  A  1 or B  1 but not both

Boolean Algebra and Logic Gates 29
 Equivalence
 Equivalence is the complement of
exclusive-OR
( A  B) '  ( A' B  AB ' ) '  ( A  B ' )( A'  B) 
 AB  A' B '  ( A  B )


A
( A  B)
B

' '
F  ( A B  C )  ( B  AC ) Simplify it…

Boolean Algebra and Logic Gates 30

 Integrated Circuits
 SSI (Small Scale)
 Less than 10 gates in a package
 MSI (Medium Scale)
 10-1000 gates in a package
 LSI (Large Scale)
 1000s of gates in a single package
 VLSI (Very Large Scale)
 Hundred of thousands of gates in a single
package

Boolean Algebra and Logic Gates 31

 Study Problems
 Course Book Chapter – 2 Problems
 2–1
 2–3
 2–5
 2–8
 2 – 12
 2 – 14

Boolean Algebra and Logic Gates 32

 Questions

Boolean Algebra and Logic Gates 33