Scribd
Upload
31 views

Combinational Logic

Combinational logic circuits consist of logic gates whose outputs depend only on the current input levels. Standard combinational circuits include adders, subtractors, comparators, decoders, encoders, and multiplexers. Boolean expressions can be implemented using sum-of-products form with AND and OR gates, or product-of-sums form using AND-OR-Invert gates. Exclusive-OR and exclusive-NOR gates can also be made from combinations of AND, OR, and inverter gates. Combinational circuits can be designed from Boolean expressions or truth tables by implementing the logic with gates. NAND and NOR gates are considered universal gates since they can be used to implement all other logic functions. The output waveforms of

Uploaded by

ROGIELYN EBETO
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
31 views

Combinational Logic

Combinational logic circuits consist of logic gates whose outputs depend only on the current input levels. Standard combinational circuits include adders, subtractors, comparators, decoders, encoders, and multiplexers. Boolean expressions can be implemented using sum-of-products form with AND and OR gates, or product-of-sums form using AND-OR-Invert gates. Exclusive-OR and exclusive-NOR gates can also be made from combinations of AND, OR, and inverter gates. Combinational circuits can be designed from Boolean expressions or truth tables by implementing the logic with gates. NAND and NOR gates are considered universal gates since they can be used to implement all other logic functions. The output waveforms of

Uploaded by

ROGIELYN EBETO
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 26

Combinational Logic Circuits

Combinational Circuit
• Consists of input variables, logic gates, and output variables.
• In combinational logic, the output level is at all times dependent on
the combination of input levels.
Standard Combinational Circuits
• Adders
• Subtractors
• Comparators
• Decoders
• Encoders
• Multiplexers
AND-OR Logic
• In Sum-of-Products (SOP) form,
basic combinational circuits
can be directly implemented
with AND-OR combinations if
the necessary complement
terms are available.
AND-OR Logic
• An example of an SOP implementation is shown. The SOP
expression is an AND-OR combination of the input variables and the
appropriate complements
AND-OR-Invert Circuit
• When the output of a SOP form is inverted, the circuit is called an
AND-OR-Invert circuit. The AOI configuration lends itself to product-
of-sums (POS) implementation. An example of an AOI
implementation is shown. The output expression can be changed to
a POS expression by applying DeMorgan’s theorem twice.
Exclusive-OR Logic
• Although this circuit is considered a type of logic gate with its own
unique symbol, it is actually a combination of two AND gates, one
OR gate, and two inverters, as shown.
Exclusive-NOR Logic
• The complement of the exclusive-OR function is the exclusive-NOR.
Implementing Combinational Logic
A. Implement a logic circuit from a Boolean expression
B. Implement a logic circuit from a truth table
C. Minimize a logic circuit
A. From a Boolean Expression
• Example 1
A. From a Boolean Expression
• Example 2
A. From a Boolean Expression
• We can still reduce the number of gates for example 2.
• Propagation delays (a major consideration in logic circuit design) are
additive, so the more gates or inverters between input and output,
the greater the propagation delay time.
A. From a Boolean Expression
B. From a Truth Table
Example 1: Design a logic circuit to implement the operation specified
in the truth table
B. From a Truth Table
B. From a Truth Table
Example 2: Develop a logic circuit with four input variables that will
only produce a 1 output when exactly three input variables are 1s.
B. From a Truth Table
Solution:
B. From a Truth Table
Answer:
NAND Gates – Universal Gates
• NAND gates are sometimes called universal gates because they can
be used to produce the other basic Boolean functions.
NOR Gates – Universal Gates
• NOR gates are also universal gates and can form all of the basic
gates.
NAND Logic
• Recall from DeMorgan’s theorem that . By using equivalent symbols, it
is simpler to read the logic of SOP forms. The earlier example shows
the idea:

• The logic is easy to read if you (mentally) cancel the two connected
bubbles on a line.
NOR Logic
• Alternatively, DeMorgan’s theorem can be written as . By using
equivalent symbols, it is simpler to read the logic of POS forms. For
example,

• Again, the logic is easy to read if you cancel the two connected
bubbles on a line. (Dual Symbols)
Pulsed Waveforms
• The following is a review of the operation of individual gates for use in
analyzing combinational circuits with pulse waveform inputs:
1. The output of an AND gate is HIGH only when all inputs are HIGH at the
same time.
2. The output of an OR gate is HIGH only when at least one of its inputs is
HIGH.
3. The output of a NAND gate is LOW only when all inputs are HIGH at the
same time.
4. The output of a NOR gate is LOW only when at least one of its inputs is
HIGH
Pulsed Waveforms
• For combinational circuits with pulsed inputs, the output can be
predicted by developing intermediate outputs and combining the
result.
• You can develop the truth table for the circuit and enter 0’s and 1’s
on the waveforms. Then read the output from the table
Pulsed Waveforms Example
• Predict the Outputs G1, G2, and G3
Pulsed Waveforms Example

You might also like