Scribd
Upload
52 views

Chapter 2 Boolean Algebra v2

This document describes Boolean algebra and logic gates. It covers: - The basic logic gates - OR, AND, NOT, NOR, and NAND gates. It defines their operations and provides truth tables and timing diagrams. - Examples of describing logic circuits using Boolean expressions and determining the logic state of outputs given input values. - Implementing logic circuits by drawing circuit diagrams for given Boolean expressions, using basic gates only.

Uploaded by

marlar24
Copyright
© © All Rights Reserved
Available Formats
Download as KEY, PDF, TXT or read online on Scribd
52 views

Chapter 2 Boolean Algebra v2

This document describes Boolean algebra and logic gates. It covers: - The basic logic gates - OR, AND, NOT, NOR, and NAND gates. It defines their operations and provides truth tables and timing diagrams. - Examples of describing logic circuits using Boolean expressions and determining the logic state of outputs given input values. - Implementing logic circuits by drawing circuit diagrams for given Boolean expressions, using basic gates only.

Uploaded by

marlar24
Copyright
© © All Rights Reserved
Available Formats
Download as KEY, PDF, TXT or read online on Scribd
You are on page 1/ 25

Official (Closed) - Non Sensitive

Chapter 2 Boolean Algebra


Electrical & Electronics Technology
(29EAET)

Mechanical Track (Oct 21)


Official (Closed) - Non Sensitive

Instructional Objectives
Describe the operation and construct the truth table for the
AND, OR, NOT, NOR and NAND gates.
Draw timing diagrams for the basic gates and logic circuits.
Simplify complex logic circuits by applying the various
Boolean identities and laws
Draw logic gates using the new IEEE/ANSI Standard Logic
symbols.
Official (Closed) - Non Sensitive
2.1 Introduction to General Logic Terms &
Terminology
Digital circuits operate in binary mode where each input or
output voltage is at one of 2 predefined ranges (representing
logic 0 and 1).

A
B LOGIC Y
CIRCUIT
A, B, C and YCare signals that represent one of 2 possible states:
Logic 0 or Logic 1
Official (Closed) - Non Sensitive

2.1.1 Information Regarding the Logic Gates


Basic building blocks for digital circuits.
Logic gate has one output and one or more input terminals.
Operation of logic circuits can be described using a truth table
or a Boolean expression.
Truth table shows the output response for all combinations of
logic levels at the inputs.
Official (Closed) - Non Sensitive

2.1.1 Information Regarding the Logic Gates


Boolean algebra has only 3 basic operators

Logical OR (+) e.g. A+B

Logical AND (.) e.g. A⋅B or just AB (without “.” )


Logical NOT () e.g. 

Boolean expression shows the output as a function of inputs represented as Boolean variables
This allows the use of Boolean algebra as a tool for the analysis and design of digital circuits.
Official (Closed) - Non Sensitive

Example 2.1
A logic circuit with two inputs A and B and an output Z, how
many combinations of inputs will you have and draw out the
truth table.

Solution
2 inputs ⇒ 2n = 22 = 4 combinations of inputs
Truth table shows the 4 combinations of inputs (outputs may vary depending on the
boolean expression)
Official (Closed) - Non Sensitive

Example 2.2
A television will only turn on (represented by Boolean variable output Z) under the
following conditions:
A (power supply) and B (remote control) are at logic 1, or
A (power supply) and C (control button) are at logic 1.
Draw out the truth table.
Official (Closed) - Non Sensitive

2.1.2 Understanding OR Operation


Switch A
Lamp

Switch B

Switch open ⇨ Logic 0


Switch close ⇨ Logic 1
Power supply
Lamp turns off ⇨ Logic 0
Lamp turns on ⇨ Logic 1
Official (Closed) - Non Sensitive

2.2 Basic Logic Gates – OR Gate

A
X =A+B
B

Truth Table
Official (Closed) - Non Sensitive

2.2.1 Timing Diagram for OR Gate


Official (Closed) - Non Sensitive

2.3 Basic Logic Gates – AND Gate

A
X=A.B
B

Truth Table
Official (Closed) - Non Sensitive

2.3.1 Timing Diagram for AND Gate


Official (Closed) - Non Sensitive

2.4 Basic Logic Gates – NOT Gate

Truth Table
Official (Closed) - Non Sensitive

2.4.1 Timing Diagram for NOT Gate

'1'
A
'0'

'1'
X
'0'
Official (Closed) - Non Sensitive

2.5 Universal Gates – NOR Gate

Truth Table
Official (Closed) - Non Sensitive

2.5.1 Timing Diagram for NOR Gate

'1'
A
'0'

'1'

B
'0'

'1'
X
'0'
Official (Closed) - Non Sensitive

2.6 Universal Gates – NAND Gate

Truth Table
Official (Closed) - Non Sensitive

2.6.1 Timing Diagram for NAND Gate


'1'
A
'0'

'1'
B
'0'

'1'
X
'0'
Official (Closed) - Non Sensitive

2.7 Describing Logic Circuits


Determine the Boolean expressions for the stated outputs:
Example 2.3
A Y
B Z
C Z= YC = (A+B) C
Y=
Z=
Example 2.4
A Y
B Z
C Z= CY = C(A+B)
Y=
Z=
Official (Closed) - Non Sensitive

2.7 Describing Logic Circuits


Example 2.5
Determine the Boolean expressions for the output X.

A
C
C A
B X
A
B
D
Official (Closed) - Non Sensitive

2.7 Describing Logic Circuits


Example 2.6
Determine the logic state of the output X if inputs A = 0, B = 1, C = 1 and D = 0.

A
1.1.1 = 1
B
X
C X = 1. 0 = 0
1+0 = 1
D
Official (Closed) - Non Sensitive

2.8 Implementing Logic Circuits


Example 2.7
Draw the logic circuit for the Boolean expression :
Official (Closed) - Non Sensitive

2.8 Implementing Logic Circuits


Example 2.8
Draw the logic circuit for the Boolean expression :
Official (Closed) - Non Sensitive

2.8 Implementing Logic Circuits


Example 2.9
Draw the logic circuit for the Boolean expression using basic gates only:
Official (Closed) - Non Sensitive

2.8 Implementing Logic Circuits


Example 2.10
You are required to use gates with not more than 2-input to draw the logic
circuit for the Boolean expression :

You might also like