Digital systems

Difference between
Analog and Digital
Number system
 Decimal number System
(Base 10)
 Binary number System
(Base 2 )
Digital systems

 A digital system is a system whose inputs

and outputs fall within a discrete, finite set of
values
 Two main types
1
 Combinational 7
3
 Outputs dependent only on current input
 Sequential
 Outputs dependent on both past and present inputs
 Positive and Negative Logic
 In positive logic systems, a high voltage is
associated with a logic 1, and a low voltage
with a logic 0.
 While in negative logic systems, a high
voltage is associated with a logic 0, and a low
voltage with a logic 1.
Combinational Logic Circuits

 Aims
 To express the inputs and outputs of a system in
binary form
 To develop the relationships between these inputs
and outputs as a truth table
 To simplify the Boolean expression using algebra
or Karnaugh maps
 To select suitable electronic devices to implement
the required function
 Basic logic gates
Not x
x
x xy x xyz
And y y
z
x x+y x x+y+z
Or y
y z
x xy
Nand y
x x+y
Nor y
x xÅy
Xor y
7
Truth Tables and Boolean Notation

 Circuits with one input

Buffer P=A
A P
 A P
0 0
1 1

A P
 Not P=A
0 1 A P
1 0
Basic AND / OR

 Circuits with two Inputs

A B P
0 0 0
 AND P = A.B 0 1 0 A P
1 0 0 B
1 1 1

A B P
0 0 0 A
 OR P=A+B 0 1 1 P
B
1 0 1
1 1 1
NAND / NOR

 Problems with two Inputs

A B P
0 0 1 A
 NAND P = A.B 0 1 1 P
1 0 1
B
1 1 0

A B P
0 0 1
A
0 1 0 P
 NOR P=A+B 1 0 0
B
1 1 0
 NAND
 A “universal” gate
 any digital system can be implemented with it

 AND, OR, NOT can be obtained from NAND gates

NAND
= x
0
y
0
(xy)’
1
0 1 1
1 0 1
1 1 0
 NOR Implementation
 A universal gate
 The dual of NAND
 All procedures/rules for NAND are dual of the

corresponding procedures/rules for NOR NOR

 NOT OR AND implemented with NOR x y
0 0
(x+y)’
1
0 1 0
1 0 0
1 1 0
XOR / XNOR

 Circuits with two Inputs:

A B P
 XOR P=AÅB 0 0 0
0 1 1
A
1 0 1 P
B
1 1 0

A B P
0 0 1
 XNOR P = A Å B 0 1 0
A
B
P
1 0 0
1 1 1
Algebraic Laws

 DeMorgan’s Laws
 The AND and OR functions can be shown to be
related to each other through the following
equations:

AB  A+ B
A B  A+ B
A B  A+ B
AB  A+ B
DeMorgan
 DeMorgan’s Laws
 NOT the individual terms
 Change the sign
 NOT the lot

.
Exercise

A B A+B A.B A.B P

Complete the truth table
for this circuit and name 0 0 0 0 1 0
the equivalent primitive
function/gate.
0 1 1 0 1 1

1 0 1 0 1 1

1 1 1 1 0 0
Sum of Products/Product of Sums

 For all combinations of inputs for which the output is

a logical true:

 Combining the minterms with OR gives the sum-of-

products

 For all combinations of inputs for which the output is

a logical false:

 Combining the maxterms with AND gives the

product-of sums.
Exercise

A B C P
Write out the sum-of-products expression
0 0 0 1 for the truth table : 4 answers
0 0 1 1 Net results to B’…
0 1 0 0
0 1 1 0
A.B.C + A.B.C + A.B.C + A.B.C
1 0 0 1
1 0 1 1
1 1 0 0
1 1 1 0
Example

 Consider a buzzer which sounds when :

 The lights are on and
 The door is open and A
 No key is in the ignition
B Alarm system P Active
C

VariableValue Situation
A 1 Lights are on
0 Lights are off
B 1 Door is open
0 Door is closed
C 1 Key is in ignition
0 Key is out of ignition
P 1 Buzzer is on
0 Buzzer is off
Example
A B C P
0 0 0 0
 Truth Table 0 0 1 0
 A Truth Table can be 0 1 0 0
used to show the 0 1 1 0
relationships between : 1 0 0 0
 the 3 inputs and 1 0 1 0
1 1 0 1
 the single output
1 1 1 0

lights A
door B P buzzer
 Implementation as a
circuit using logic gates keys C
Minimization

 The expression can be simplified in one of

two ways:

 via algebra
 via Karnaugh map
BCD Display