Digital Logic & Boolean Algebra
Digital Logic & Boolean Algebra
Algebra
Learning Objectives
1. Define and Identify Boolean Algebra Rules
• HIGH LOGIC 1
• LOW LOGIC 0
Two Valued Logical Symbol
A + B = Y
0 + 0 = 0
A
A + B = Y
1 + 0 = 1
A
A + B = Y
0 + 1 = 1
A
A + B = Y
1 + 1 = 1
Logical Addition
A+B = Y
0+0 = 0
1+0 = 1
0+1 = 1
1+1 = 1
Logical Multiplication
A B
A . B = Y
0 . 0 = 0
A B
A . B = Y
1 . 0 = 0
A B
A . B = Y
0 . 1 = 0
A B
Y
A . B = Y
1 . 1 = 1
Logical Multiplication
A.B = Y
0.0 = 0
1.0 = 0
0.1 = 0
1.1 = 1
Digital (Logic) Circuit
• Signals in digital circuit operates using 2 discrete values and therefore
said to be Binary. A binary digit, called a bit, has two values: 0 and 1
• Binary logic resembles binary arithmetic, and the operations AND and
OR have similarities to multiplication and addition respectively
Basic Logic Operations
• NOT Operation (Complementation)
X NOT (X)/
0 1
1 0
NOT gate or Inverter
Basic Logic Operations
• AND Operation (Logical Multiplication)
X Y X AND Y/ (X.Y)
0 0 0
0 1 0 Two-input AND gate
1 0 0
1 1 1
Basic Logic Operations
• OR Operation (Logical Addition)
X Y X OR Y/ (X+Y)
0 0 0
0 1 1 Two-input OR gate
1 0 1
1 1 1
Logic Gates
• Example
Logic Gates
Logic Gates
Logic Gates – HW – Exercise
Identify each of these logic gates
by name, and complete their
respective truth tables:
Boolean Laws
• Commutative law
• Associative law
• Distributive law
• AND law
• OR law
• INVERSION law
Commutative Law
A + B = B +A
A . B = B . A
Associative Law
(A + B)+C = A+(B+C)
(A . B). C = A. (B . C)
Distributive Law
A . ( B + C ) = A B + AC
AND Law
OR Law
INVERSION Law
´
𝑨= 𝑨
Boolean Algebra Rules
Example
• Using Boolean algebra, Simplify the following expressions
1.
2.
3.
4.
Exercises
1. Select the Boolean expression that is not equivalent to
(i) A X Y Z X YZ X Y Z XYZ
(ii ) X AB A( B C ) B( B C )
(iii ) A X Y X Y ( X Y ). X Y
Exercises
• AND Gate
• OR Gate
• NOT Gate
• NANAD Gate
• NOR Gate
• XOR Gate
• XNOR Gate
AND Gate
• Example:
Boolean Functions
Boolean Functions
Boolean Functions
Boolean Functions
Minterms and Maxterms
Minterms and Maxterms
• Example
Minterms and Maxterms
• Example – as a sum of Minterms
Minterms and Maxterms
• Example – as a product of Maxterms
...
..
Minterms and Maxterms
Example
• What are the minterms and maxterms of ?
Standard Form
• Results in a two-level structure of gates
• Sum of Products
• Product of Sums
• Example:
Standard Form
• Example:
Standard Form
• Example: and
Exercises
1. Convert the following logic gate circuit into a Boolean expression,
writing Boolean sub-expressions next to each gate output in the
diagram:
Exercises
2. Convert the following logic gate circuit into a Boolean expression,
writing Boolean sub-expressions next to each gate output in the
diagram:
Exercises
3. Convert the following logic gate circuit into a Boolean expression,
writing Boolean sub-expressions next to each gate output in the
diagram:
Exercises
4. Following Boolean expression is written down on a paper and
handed over to you, to build a gate circuit:
Form the circuit by making the necessary connections between the pins
of 74LS37 integrated circuits (IC’s)
Example
6. For the logic circuit below complete the truth table and find the
Boolean expressions
Example
Question 1
• Implement NOT, AND, OR operations using:
• NAND gates only
• NOR gates only
Implementation of Gates Using NANAD
Gate