Chapter -9

Introduction to Boolean Algebra

&
Digital Logic

W.C. Deshapriya 1
Learning outcomes

After completing this session student will be able to;

• Identify the basic Boolean operators
• Simplify basic logic function.
• Simplify sum-of-products (SOP) and products of sum
(SOP).
• Identify the Digital versus Analog signals.

2
Boolean values
• Most of the system working with Boolean signal.
• There are two Boolean values called as true and false.

• Boolean Constants
these are ‘0’ (false) and ‘1’ (true)

• Boolean Variables
variables that can only take the values ‘0’ or ‘1’

3
Boolean operators

• There are three main operators used in boolean system.

AND operator .
OR operator +
NOT operator ~

4
Boolean + operator

• The symbol ‘+’ is used as boolean addition operator. It is known

as ‘OR’ operator.
• The truth table of the Boolean OR operator shown as below.

OR operator (+)

• A, B are two boolean Input and C is the output of the “or” operator:
C = A+B , C = A or B
5
Boolean . operators
• The symbol ‘.’ is used for boolean multiplication operator. It is known as
‘AND’ operator.
• The truth table of boolean AND operator shown as below.

AND operator (.)

• A, B are two boolean Input and C is the output of the “and” operator
C = A.B , C = A and B

6
Boolean ~ operators
• The symbol ‘~’ is used for boolean complementation operator. It is
known as ‘NOT’ operator.
• The truth table of boolean NOT operator shown as below.

NOT operator (~)

• A is a Input and B is the output of the “not” operator:

B = ~A , B = Not A

7
Boolean Algebra Laws
The boolean symbols “0” and “1” used to represent a digital input or output,
Identity Laws (A – is boolean variable )

8
Boolean Algebra Laws

Commutative law Absorption law

Distributive law De Morgan’s law

Associative law Note also

9
Simplify Boolean expression
Using the Boolean laws may simplify a complex logic expression

Example - 1:
Simplify:

X = A BC+ A’BC +AC +AC’

Using the commutative and distributive laws

= BC(A+A’) +A(C+C’)
= BC (1) +A(1)
= BC + A

10
Example - 2:
Simplify: X =(A + B).(A + C)

=A.A + A.C + A.B + B.C – Distributive law

=A + A.C + A.B + B.C – Idempotent AND law (A.A = A)
=A(1 + C) + A.B + B.C – Distributive law
=A.1 + A.B + B.C – Identity OR law (1 + C = 1)
=A(1 + B) + B.C – Distributive law
=A.1 + B.C – Identity OR law (1 + B = 1)

=A + (B.C) – Identity AND law (A.1 = A)

=A+BC

11
Example - 3:
Simplify:

12
Activity 01
Simplify the following expression:

1. P= AB + A(B + C)+ B(B + C)

2. X= (A + B)(B + C + A)
3. E= AC + B(B + A)
4. R= AD + (A+D)(B + C)

13
Example - 4:
Simplify: F = (P+(QR)’)’

14
Example - 4:
Simplify: F = (P+(QR)’)’

apply De Morgan’s 2nd low (A+B)’ = A’. B’

= (P)’ . ((QR)’)’

= ((QR)’)’ (convert to ) QR

= P’. QR

= P’QR

15
Example - 5:
Simplify: F= (A.(A+C))’

16
Example - 5:
Simplify: F= (A.(A+C))’

=(A(A+C))’
=(A.(A+C))’
=(A.A+A.C)’
=A’+ (A+C)’
=(A+ AC)’
=A’ +A’.C’
=(A(1+C))’
=A’(1+C’)
=(A.1)’
= A’
= A’

17
Example - 6:
Simplify: F= ((a+bc)’+(ab’)’)’

18
Example - 6:
Simplify: F= ((a+bc)’+(ab’)’)’

19
Activity 02
Simplify the following expression:

1. F= (a+b’c)’

2. F= (a’+b’).c’

3. F= (a’+b’).c

4. F= ((ab’)+ a)’

5. F= ((a+b’c)’+(ab’)’)’

20
The Sum-of-Products (SOP) Form
When two or more product terms are summed by Boolean addition, the
resulting expression is a sum-of-products (SOP).
Examples:

• AB + ABC
• ABC’ + CD’E + BCD
• AB + BCD’ + AC

21
Activity 03
Convert each of the following boolean expressions to SOP form:

1. A(B + BC)
2. B + B(CD + EF)
3. (A + B)(B + C + D)
4. ((A + B)’ + C)’
5. (A’ + B + C)(B’ + C + D’)

22
The Products-of-Sum (POS) Form
When two or more sum terms are multiplied, the resulting expression is a
product-of-sums (POS).
Examples:

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

23
Activity 04
Example
Convert each of the following Boolean expressions to POS form:

• AC’+B’A+B’C’
• AA+AC’

24
 Digital signals
• Digital signals process with digital values which can take only a
limited number of values (discrete steps).
• It has exactly two possible values, i.e., 0 and 1.

• Digital 0 and 1 (low and High)

25
Analog systems
• Analog systems process with analogue values which can take any
value within a range.
• It has many possible values between 0 and 1(low and High).

Variable Resistor

Vol

26
Difference between analog and digital signals
We represent two voltage ranges
as two logic signal

Logic 0  0 V to 0.4 V
Logic 1  2.4 V to 5 V

27
Logic Gates
• The building blocks used to create digital circuits are logic gates (similar
to resistors in analog circuits)
• There are three basic logic gates and a range of other simple gates
• Each gate has its own logic symbol which allows complex functions to be
represented by a logic diagram
• The function of each gate can be represented by a truth table or using
Boolean notation (a mathematical notation)

28
Primary Logic Gates

29
30
31
Secondary Logic Gates

32
33
✓ A buffer simply passes its input, unchanged, to its output

✓ It is mainly used to increase propagation delay

34
• The output of the XOR operation is true only when the
values of inputs are differ.

35
36
Used following web site to simulate simple logic gate circuits:
https://logic.ly/demo/
https://circuitverse.org/simulator

37
Thanks!

38