Scribd
Upload
72 views15 pages

EEE140 Digital Electronics I Lecture #5: - Combinational Logic Analysis

This document discusses a lecture on combinational logic analysis. It will cover basic combinational logic circuits like AND-OR logic using sum of products (SOP) expressions. It discusses implementing logic from Boolean expressions to circuits using AND, OR, and NOT gates. Examples are given of AND-OR-Invert, XOR, and XNOR logic circuits. Implementing combinational logic from expressions, reducing expressions to SOP form to minimize propagation delay, and troubleshooting logic circuits are also covered.

Uploaded by

MICHAEL K. E. Donkor
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
72 views15 pages

EEE140 Digital Electronics I Lecture #5: - Combinational Logic Analysis

This document discusses a lecture on combinational logic analysis. It will cover basic combinational logic circuits like AND-OR logic using sum of products (SOP) expressions. It discusses implementing logic from Boolean expressions to circuits using AND, OR, and NOT gates. Examples are given of AND-OR-Invert, XOR, and XNOR logic circuits. Implementing combinational logic from expressions, reducing expressions to SOP form to minimize propagation delay, and troubleshooting logic circuits are also covered.

Uploaded by

MICHAEL K. E. Donkor
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 15

EEE140 Digital Electronics I

Lecture #5
- Combinational Logic Analysis -

By Dr. Shahrel A. Suandi


What will be covered in this topic?
• 5-1 Basic Combinational Logic Circuits
• 5-2 Implementing Combinational Logic
• 5-3 The Universal Property of NAND and NOR
Gates
• 5-4 Combinational Logic Using NAND and NOR
Gates
• 5-5 Logic Circuit Operation With Pulse
Waveform Inputs
• 5-6 Combinational Logic with VHDL
• 5-7 Troubleshooting
Introduction
• So far we have learnt about logic circuits as
independent circuit. From this chapter we will
learn about logic gates which have been
connected together to produce a specified
output for certain specified combinations of input
variables, with no storage involved – the
resulting circuit is in the category of
combinational logic
• Important sections to know:
– SOP and POS expressions
5-1 Basic Combinational Logic
Circuits
• AND-OR logic (remember SOP to get a
clearer image of this)
– Details on this type of logic are given below.
We need to know the symbol and how it is
used/described
How to describe the AND-OR
logic?
• From the figure (Figure 5-1), we may say
something like this:
– For a 4-input AND-OR logic circuit, the output
X is HIGH (1) if both input A and B are
HIGH(1) or both input C and input D are
HIGH(1)
– Please refer Table 5-1
Example 5-1
AND-OR-Invert Logic
• A complemented version of AND-OR
Logic
• If AND-OR logic implements SOP, then
AND-OR-Invert implements POS
• The details of this are given below:
Example 5-2
Exclusive-OR Logic
• This type of logic is actually a combination of 2
ANDs, 1 OR and 2 inverters

• The output expression is X = AB̄ + ĀB


• Using the special operator symbol for XOR
X =A⊕B
Exclusive-NOR Logic
• This is the complement of XOR. A
combination of 2 ANDs, 1 OR and 2
inverters (Notice that the quantity of logic
gates is the same)
• Usually written as XNOR
• The details:
XOR and XNOR logic circuits

XOR

XN OR
5-2 Implementing Combinational
Logic
• From a Boolean Expression to a Logic
Circuit
– Examine the expression given. In our book,
the two terms are summed after being
multiplied
X = AB + CDE
– The logic circuit is
5-2 Implementing Combinational
Logic (Cnt’d 1)
• Let’s try to do this
X = AB(C D̄ + EF )
• What will we get is something like this
5-2 Implementing Combinational
Logic (Cnt’d 2)
• Problem: propagation delay from the input
to the output
• Remedy: usually, we will reduce the
expression to SOP form (in the book
example, we straight away get the SOP
form from the given expression)
X = AB(C D̄ + EF )
= ABC D̄ + ABEF
Finally, we get this logic circuit

X = ABC D̄ + ABEF

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy