Introduction To Digital Electronics: Boolean Algebra
Introduction To Digital Electronics: Boolean Algebra
Boolean Algebra
1
Introduction to Digital Electronics
Boolean Algebra
0/1
True/False
On /Off (Current/Logic Gates/Devices such as motors)
High/Low (Voltage)
Magnetized /Demagnetized (Hard Disk Platter)
Light passes/Light does not pass (Punch Card Holes)
Light reflects/Light does not reflect (DVD/Optical fiber)
2
Introduction to Digital Electronics
Boolean Algebra
4
Introduction to Digital Electronics
Boolean Algebra
5
Boolean Algebra Operators and Boolean Gates
Gates Circuit Algebraic Operator Truth
Symbol Symbol Table
NOT 𝐹 = 𝐴 or 𝐴′ or ! 𝐴 or ~𝐴
AND 𝐹 = 𝐴. 𝐵 or 𝐴𝐵 or 𝐴 ∗ 𝐵
OR 𝐹 =𝐴+𝐵
NAND 𝑭 = (𝑨. 𝑩)
NOR 𝑭= 𝑨+𝑩
XOR 𝐹=
XNOR
6
Introduction to Digital Electronics
Boolean Algebra
Mapping process:
1. Make a matrix with cells equal to the
total number of possible output.
2. Arrange the inputs along the edges of
the matrix.
3. Put the output corresponding to the
combination of the row-column
inputs into the cells.
Introduction to Digital Electronics
Boolean Algebra
All the gates can be created with a series of NAND gates, or a series of
NOR gates.
For example, in a NAND gate, if the two inputs are shorted (joined
together), one can have an inverter gate; Adding another inverter to
the output, one has an AND gate; then inverting the inputs makes an
OR gate.
Theoretically, one could design an entire computer out of nothing but
NAND gates.
NAND gate and NOR gate are called universal gates.
NAND gates are used as a string of bits in flash storage (USB pen
drive)- NAND Flash has high density data storage capabilities.
8
Introduction to Digital Electronics
Boolean Algebra
*
*
*
*
*
*
10
Introduction to Digital Electronics
Boolean Algebra
11
Introduction to Digital Electronics
Boolean Algebra
Example Problems of Boolean Algebra
Example-1 Example-2
12
Introduction to Digital Electronics
Boolean Algebra
Example Problems of Boolean Algebra
Example-3 Example-4
13
Introduction to Digital Electronics
Boolean Algebra
Example Problems of Boolean Algebra
Example-5 Example-6
14
Introduction to Digital Electronics
Boolean Algebra
Example Problems of Boolean Algebra
Example-7 Example-8
15
Introduction to Digital Electronics
Boolean Algebra
Example Problems of Boolean Algebra
Example-9 Example-10
16
Introduction to Digital Electronics
Boolean Algebra
Example Problems of Boolean Algebra
Example-11
17
Introduction to Digital Electronics
Boolean Algebra
Example Problems of Boolean Algebra
Example-12
18
Introduction to Digital Electronics
Boolean Algebra
Example Problems of Boolean Algebra
Example-13
19
Introduction to Digital Electronics
Boolean Algebra
Example Problems of Boolean Algebra
Example-14
Note
20
Introduction to Digital Electronics
Boolean Algebra
21
Introduction to Digital Electronics
Boolean Algebra
22
Introduction to Digital Electronics
Boolean Algebra
(SOM)
23
Introduction to Digital Electronics
Boolean Algebra
24
Introduction to Digital Electronics
Boolean Algebra
(POS)
25
Introduction to Digital Electronics
Boolean Algebra
Let’s simplify
= 𝐵1 + 𝐵2 . [𝐵1. 𝐵1 + 𝐵2 + 𝐵2. 𝐵1 + 𝐵2
= 0 + 0. 𝐵2 + 𝐵1. 𝐵2 + 𝐵1. 𝐵2
𝑦 = 𝐵1. 𝐵2
26
Introduction to Digital Electronics
Boolean Simplification Let’s simplify
= 𝐵1. 𝐵1. 𝐵2 + 𝐵2
= 𝐵1 + 𝐵1. 𝐵2 + 𝐵1. 𝐵2
Let’s simplify
= 𝐵2. 𝐵1. 𝐵2 + 𝐵1
29
Introduction to Digital Electronics
Boolean Simplification Binary Truth Table
S1 S2 S3 M
OFF
OFF
ON Both S1 and S3
ON change values while
S2 remains fixed
𝑀 = 𝑆1. 𝑆2 + 𝑆1. 𝑆2
𝑀 = 𝑆2(𝑆1 + 𝑆1)
𝑀 = 𝑆2.1
𝑀 = 𝑆2 31
Introduction to Digital Electronics
(POS)
S1 S2 S3 M 0
𝑀 = 𝐵1 + 𝐵2 + 𝐵3 . 𝐵1 + 𝐵2 + 𝐵3 . 𝐵1 + 𝐵2 + 𝐵3 .
𝐵1 + 𝐵2 + 𝐵3 . 𝐵1 + 𝐵2 + 𝐵3 . 𝐵1 + 𝐵2 + 𝐵3 .
(𝐵1 + 𝐵2 + 𝐵3).(𝐵1 + 𝐵2 + 𝐵3)
𝑀 = 𝐵1 + 𝐵2 + 𝐵3 . 𝐵1 + 𝐵2 + 𝐵3 .
𝐵1 + 𝐵2 + 𝐵3 . 𝐵1 + 𝐵2 + 𝐵3
0 0
𝑀 = ( 𝐵1 + 𝐵2 + 𝐵3. 𝐵3). ( 𝐵1 + 𝐵2 + 𝐵3. 𝐵3)
𝑀 = 𝐵1 + 𝐵2 . 𝐵1 + 𝐵2
𝑀 = 𝐵1. 𝐵1 + 𝐵1. 𝐵2 + 𝐵1. 𝐵2 + 𝐵2. 𝐵2
𝑀 = 𝐵2 𝐵1 + 𝐵1 + 𝐵2 ⇒ 𝑀 = 𝐵2. 1 + 𝐵2
⇒ 𝑀 = 𝐵2 + 𝐵2 ⇒ 𝑀 = 𝐵2 ⇒ 𝑴 = 𝑩𝟐 32
Introduction to Digital Electronics
Boolean Algebra
2. Arrange the inputs variables along the edges of the matrix. For 2 input variable
system, 1 input variable along the row and 1 input variable along the column;
For 3 input variable system, 1 input variable along the row and 2 input variables
along the column or vice versa; For 4 input variable system, 2 input variables
along the row and 2 input variables along the column or 1 input variable along
the row and 3 input variables along the column or vice versa.
For example, for 2 input variables along the row (or column) the values should
be taken as 00, 01, 11 and 10 sequentially.
For 3 input variable traverse, the sequence should be 000, 001, 011, 010, 110,
111, 101 and 100.
Introduction to Digital Electronics
Boolean Algebra
K-Mapping Process:
3. Put the outputs (0’s or 1’s) corresponding to the combination of the row-
column input variables into the cells.
5. For each block of 1’s, traverse both row-wise and column-wise and list the
input variable(s) which remain unchanged.
In the expression, write all the unchanged input variables for each block
AND-ing them together. If the value of the unchanged input variable is 0,
then write its compliment in the expression.
Unchanged input variables for each block are OR-ed with other block.
34
Introduction to Digital Electronics
Boolean Algebra
K-Mapping
S1 S2 S3 M
S1S2
Motor
S3
1. At first, a matrix is created with total cells of 8 equal to the number of possible output.
2. 1 input variable (S3) is arranged in the row and 2 input variables (S1 and S2) in the column
with their values in proper sequence.
3. Output values are put into the cells.
4. For the square block of 1’s, as row traversing is done, input variable S3 changes and as
column traversing is done, input variable S1 changes, while input variable S2 remains fixed.
5. The result of the minimization is M = S2
Introduction to Digital Electronics
Boolean Algebra
0 0 1 1 1 1 0 0
1. At first, a matrix is created with total cells of 8 equal to the number of possible output.
2. All 3 input variables (S1, S2 and S3) are arranged in the column with their values in proper sequence.
3. Output values are put into the cells.
4. For the rectangular block of 1’s, as column traversing is done, input variable S1 and input variable S3
change values, while input variable S2 remains fixed.
5. The result of the minimization is M = S2
Introduction to Digital Electronics
Boolean Algebra
S2S3 00 0 0
01 0 0
11 1 1
10 1 1
1. At first, a matrix is created with total cells of 8 equal to the number of possible output.
2. 2 input variables (S2 and S3) are arranged in the row with their values in proper sequence and 1
input variable (S1) in the column
3. Output values are put into the cells.
4. For the square block of 1’s, as column traversing is done, input variable S1 changes, while row
traversing done, input variable S3 changes, while input variable S2 remains fixed.
5. The result of the minimization is M = S2
Introduction to Digital Electronics
Boolean Algebra
Logic Circuit Simplification
Let’s consider the logic circuit below. Assuming the input signals “A”, “B”
and “C” are provided from switches, sensors or other gate circuits.
38
Introduction to Digital Electronics
Boolean Algebra
Logic Circuit Simplification
Step-1:
Write a Boolean expression for the output.
39
Introduction to Digital Electronics
Boolean Algebra
Logic Circuit Simplification
Step-2:
Simplify the Boolean expression for the output by using either
Boolean algebra or K-Mapping for reducing the number of
gates.
𝑄𝑄 = 𝐴𝐵 + 𝐵𝐶(𝐵 + 𝐶)
⇒ 𝑄 = 𝐴𝐵 + 𝐵𝐵𝐶 + 𝐵𝐶𝐶
𝑄 ⇒ 𝑄 = 𝐴𝐵 + 𝐵𝐶 + 𝐵𝐶
𝑄 ⇒ 𝑄 = 𝐴𝐵 + 𝐵𝐶
𝑄 ⇒ 𝑄 = 𝐵(𝐴 + 𝐶)
Step-3:
Draw the simplified logic circuits.
Introduction to Digital Electronics
Boolean Algebra
Logic Circuit Simplification
Step-4:
Check both the original and reduced circuits using truth table.
Introduction to Digital Electronics
Practice Problems
(ii)
(iii)
Introduction to Digital Electronics
Practice Problems