Digital Electronics

Lecture 1
Introduction

1
 ANALOG VS DIGITAL

• Analog devices and systems: Process analog signals (time-

varying signals that can take any value across a continuous
range known as dynamic range)
• Digital devices and systems: Process digital signals
(analog signals that are modeled as having at any time one
of two discrete values)

2
 Digital Systems
Digital vs. Analog Waveforms

+5 +5

1 0 1
V V
Time Time

–5 –5

Digital: Analog:
only assumes discrete values values vary over a broad range
continuously

3
 Digital Systems cntd..
• A digital signal is a signal that can only have discrete
values in time
– Most common are binary digital signals, where only
two values are allowed often designated as 0 and 1
• The opposite is analog signals that can take infinite values

4
 Digital Hardware Systems
Boolean Algebra and Logical Operators

Algebra: variables, values, operations

In Boolean algebra, the values are the symbols 0 and 1

If a logic statement is false, it has value 0
If a logic statement is true, it has value 1

Operations: AND, OR, NOT

X Y X AND Y X Y X OR Y X NOT 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

5
Variables & Functions

6
 Representations of Digital Design:
Switches

Normally Open

A switch connects two points under control signal.

• when the control signal is 0 (false), the switch is open

• when it is 1 (true), the switch is closed

We will use Normally open switch in our discussion

7
A switch connects two points under control signal.

• when the control signal x is 0 (false), the switch is open

• when it is 1 (true), the switch is closed

x = 0 x = 1

(a) Two states of a switch

(b) Symbol for a switch

8
Figure: A binary switch.
 S
Battery Light
L=1 =>
x
Light is ON

(a) Simple connection to a battery

S
Power
supply x Light

(b) Using a ground connection as the return path

Figure : A light controlled by a switch. 9

 Logic expression/Logic Function

State of Light is function of input variable x.

• L=1 if x=1
• L=0 if x=0
L(x)=x
L(x)=x is a logic expression/function
Here only one switch was controlling Light.
If there are two switches then?

10
Digital Electronics & Systems 19ECE204 /19CSE203
 S S
Power
supply x1 x2 Light

(a) The logical AND function (series connection)

x1

Power
supply S Light

x2

(b) The logical OR function (parallel connection)

Figure : Two basic functions. 11

Series Connection => logical AND operation

The symbol
. Is called
AND
operator

12
Parallel Connection => logical OR operation
Symbol + is
called OR
operator

13
Here three switches are controlling the light in more complex way.
Can you identify the relation?

X1
S
Power
supply S X3 Light

X2

Figure: A series-parallel connection. 14

Here the series parallel connection of switches realizes the logic function

X1
S
Power
supply S X3 Light

X2

Figure : A series-parallel connection. 15

 Try implementation using switches

• (A+B).(C+D)
• A.(B+C).D

16
LECTURE 2

17
• Till now we saw some positive action takes place when a
switch is closed, such as turning the light on.
• It is equally interesting and useful to consider the
possibility that a positive action takes place when a switch
is opened

18
 R

Power
supply x S Light

Figure : An inverting circuit.

19
Complement Operation

Symbol – over a variable called

NOT operator.

20
 Try implementation using switches

• ((A.B)+C).(D)
• (A+B)’

21
 Truth Tables
Useful aid for giving information for a logic function.

Figure: A truth table for the AND and OR operations.

22
Truth Table for 3 input variables

Figure : Three-input AND and OR operations.

23
 Logic Gates

• Three basic logic operations can be used to implement

logic functions of any complexity.
• Each logic operation can be implemented using Logic
Gate.
• A logic gate has one or more inputs and one output that is
a function of its inputs.
• It is often convenient to describe a logic circuit by
drawing a circuit diagram, or schematic, consisting of
graphical symbols representing the logic gates.

24
 x1
x2
x1
x1 ×x2 x1 ×  ×xn
x2 ×
x2

xn

(a) AND gates

x1
x2
x1
x1 + x2 x 1 + x2 +  + xn
x2

xn

(b) OR gates

x x

(c) NOT gate

Figure: The basic gates. 25
A Larger circuit is implemented by Network of
Gates

x
1
x
2
f = ( x + x ) ×x
x 1 2 3
3

Figure: The function from Figure of switches .

26
 Analysis vs Synthesis of Logic Networks

• Analysis Process: For an existing logic network, it

must be possible to determine the function
performed by the network. This task is referred
to as the analysis process.
• Synthesis Process: The reverse task of designing a new
network that implements a desired functional behavior is
referred to as the synthesis process.
• The analysis process is straightforward and much simpler
than the synthesis process

27
Analysis example

Check how signal A &B

Are changing with input
x1 & x 2

28
Timing Diagram: Functional Behavior

Check how signal A &B

Are changing with input
x1 & x 2 29
Functionally Equivalent Networks

30
 Truth table with 4 input variables

• we can also construct truth

tables for any function.

31
 Boolean Algebra

• Boolean Algebra
– Axioms of Boolean Algebra
– Single Variable Theorem
– Two and Three variable Properties
– Complements and Duals

32
 Boolean Algebra

• In 1849 George Boole published a scheme

for the algebraic description of processes
involved in logical thought and reasoning .
Subsequently, this scheme and its further
refinements became known as Boolean
algebra.
• It was almost 100 years later that this
algebra found application in the
engineering sense. In the late 1930s
Claude Shannon showed that Boolean
algebra provides an effective means of
describing circuits built with switches .The
algebra can be used to describe logic
circuits. 33
 Boolean Algebra:Axioms
1a
1b

2a
2b

3a
3b

4a
4b
34
Boolean Algebra: Single Variable Theorems
5a
5b

6a
6b

7a
7b

8a
8b

9
35
 Principle of Duality
• Given a logic expression, its dual is obtained by replacing
all + operators with · operators, and vice versa, and by
replacing all 0s with 1s, and vice versa.
• The dual of any true statement (axiom or theorem) in
Boolean algebra is also a true statement.
X+0=X

X·1=X

36
LECTURE 3

37
 Boolean Algebra: Two & Three variable
Properties
10a
10b

11a
11b

(22)
12a
(23)
12b

13a
13b
38
 Boolean Algebra: Two & Three variable
Properties

14a
14b

17a
17b

39
 Boolean Algebra: DeMorgans Theorem

15a
15b

40
16a
16b

41
• Huntington’s basic postulates-5,8,10,12

42
Proof of DeMorgan’s Theorem using
TruthTable

43
Proof of DeMorgan’s Theorem using
TruthTable

44
 Other examples

1. Proof of 13a(Absorption law)

X + XY = X·1 + XY = X(1+Y) = X·1 = X
• Use 6a 12a 5b

2. Proof of 16a
X+X’Y = (X+X’)(X+Y) = 1· (X+Y) = X+Y
• Use 12b(distributive ) 8b 6a

3. Proof
XY+XY’ = X(Y + Y’) = X·1 = X
• Use 12a(distributive ) 8b 6a
45
 Further Examples

4. X· (X+Y)=X·X+X·Y= X+XY=X(1+Y)=X·1=X
• Use 12b(distributive) 7a 12a 5b

5. (X+Y) ·(X+Y’)=XX+XY’+XY+YY’=
X+XY’+XY+0=X(1+Y’+Y)=X·1=X

6. X(X’+Y) = XX’+XY = 0 + XY = XY

46
47
 Proof of Consensus Theorem
• Consensus Theorem gives us the relationship
XY + X’Z + YZ = XY + X’Z

– Note that in doing the reduction the first step is to and

in a 1 to the YZ term. That 1 is in the form, (X+X’).
– Try it.

48
49
Consensus theorem Proof–POS form

50
Examples

51
 Simplify
• Simplify F=X’YZ+X’YZ’+XZ

52
 Affect on implementation
• F = X’YZ + X’YZ’ + XZ

• Reduces to F = X’Y + XZ

53
54
• Try

55
• Solution:

56
 Complement of a function
• In real implementation sometimes the complement of a
function is needed.
– Have F=X’YZ’+X’Y’Z

57
 How Duals and Complement are related
• What is meant by the dual of a function?
– The dual of a function is obtained by interchanging OR
and AND operations and replacing 1s and 0s with 0s
and 1s.
• Shortcut to getting function complement
– Starting with the equation on the previous slide
– Generate the dual F=(X’+Y+Z’)(X’+Y’+Z)
– Complement each literal to get:
– F’=(X+Y’+Z)(X+Y+Z’)

58
LECTURE 4

59
Synthesis of simple circuits

60
Synthesis using AND,OR, NOT Gates

61
Sum of Products Canonical form

62
Two Variable Minterms

63
 Simple problem of synthesis
• Assume that x1 and x2 represent the states of two switches,
either of which may produce a 0 or 1.
• The function of the circuit is to continuously monitor the
state of the switches and to produce an output logic value 1
whenever the switches (x1, x2) are in states(0, 0), (0, 1), or
(1, 1). If the state of the switches is (1, 0), the output
should be 0.
• We can express the required behavior using a truth table,

64
65
Canonical SOP –implementation using Logic
Gates

The process whereby we begin with a description of the desired

functional behavior and then generate a circuit that realizes this
behavior is called synthesis.
66
Canonical SOP expression can be reduced
using Boolean Algebra

1. Using 7b,third Product term is replicated

2. Using the commutative property 10b to interchange

the second and third product terms gives

3.The distributive property 12a

4.Using 8b and 6a

67
68
Three Variable Minterms

69
• Consider three variable function and synthesize the circuit
for it.

70
• Consider three variable function and synthesize the circuit
for it.

71
• Consider three variable function and synthesize the circuit
for it.

Canonical SOP expression

72
• Draw circuit diagram
• Reduce it and again draw the reduced circuit diagram.
• Compare the cost-A good indication of the cost of a logic
circuit is the total number of gates plus the total number of
inputs to all gates in the circuit.

73
 Cost:13(5 Gates & 8 inputs) vs
27 for canonical exp ckt realization

74
 Example

Another example:

A B Cin Sum Cout Sum = A B Cin + A B Cin + A B Cin + A B Cin

0 0 0 0 0
0 0 1 1 0
0 1 0 1 0
0 1 1 0 1
1 0 0 1 0
1 0 1 0 1
1 1 0 0 1
1 1 1 1 1

Cout = A B Cin + A B Cin + A B Cin + A B Cin

75
Product of Sum Canonical Form

76
Maxterms

77
 Maxterms
• The principle of duality suggests that if it is possible to
synthesize a function f by considering the rows in the truth
table for which f = 1, then it should also be possible to
synthesize f by considering the rows for which f = 0.
• This alternative approach uses the complements of
minterms, which are called maxterms.

78
• Consider three variable function and synthesize the circuit
for it using Maxterms

79
• Consider three variable function and synthesize the circuit
for it using Maxterms

Canonical POS expression

80
Reduce it and draw circuit diagram

Using 14b-combining property

81
Q1>Find the cost of Canonical SOP expression.
Q2>Reduce this expression and find cost again.
Q3>Write corresponding Maxterm list-canonical POS form
Q4>Reduce canonical POS expression and find the cost.
Q5>Compare Q2 and Q4 costs

82
83
Find minimum cost SOP expression for this
function

84
85
86
87
Try this problem: Write Truth Table and draw
circuit diagram

The required behavior is that the light should be on only if one,

but not both, of the toggle switches is in the top position.

88
Truth Table and Circuit diagram

89
 Synthesis Example

A circuit that controls a given digital system has three inputs:

x1, x2, and x3.It has to recognize three different conditions:
• Condition A is true if x3 is true and either x1 is true or x2 is
false
• Condition B is true if x1 is true and either x2 or x3 is false
• Condition C is true if x2 is true and either x1 is true or x3 is
false
The control circuit must produce an output of 1 if at least two
of the conditions A, B, and C are true. Design the simplest
circuit that can be used for this purpose.

90
91