Digital Logic Design Combinational Logic
Digital Logic Design Combinational Logic
Digital Logic Design Combinational Logic
Chapter V
Combinational logic
Addis Ababa Science and Technology
College of Electrical and Mechanical Engineering
Lecturer: Ambasa Aklilu (MSc)
Introduction
• Logic circuit for digital systems maybe combinational or sequential.
• A combinational circuit consists of logic gates whose outputs at any
time are determined from only the present combination of inputs.
• A combinational circuit performs an operation that can be specified
logically by a set of Boolean functions.
• In contrast, sequential circuits employ storage elements in addition
to logic gates.
• The outputs of sequential circuits are a function of the input and the
state of the storage elements.
Basic combinational logic circuits
• AND-OR logic circuit
➢Directly implements an SOP expression.
• AND-OR-Inverter logic circuit
➢This kind of implementation leads to POS expression.
• Exclusive-OR logic circuit
➢A combination of two AND gates, one OR gate and two inverters.
• Exclusive-NOR logic circuit
➢Implemented by simply inverting the output of an exclusive-OR.
Functions of combinational logic circuit
• A combinational circuit consists of an interconnection of logic gates.
• Expressions can be derived for the sum and the output carry as
functions of the inputs. Notice that the output carry is a 1 only when
both A and B are 1. so Cout = AB
BASIC ADDERS (Arithmetic Binary Adder)
• Observe that the sum output is a 1 only if the input variables A and B
are not equal. The sum can therefore be expressed as the XOR of the
input variables.
BASIC ADDERS (Arithmetic Binary Adder)
• The Full-Adder
• The second category of adder is the full-adder
• The full-adder accepts two inputs bits and an input carry and generates a sum
output and an output carry. The basic difference between a full-adder and a
half-adder is that the full-adder accepts an input carry.
BASIC ADDERS (Arithmetic Binary Adder)
• The full adder must add the two inputs bits and the input carry.
• From the half-adder you know that the sum of the inputs bits A and B
is the XOR of those two variables.
• For the input carry to be added to the input bits, it must be XORed
with
• For the input carry (Cin) to be added to the input bits, it must be
XORed with . This means that to implement the full-adder sum
function , the 2-input XOR gate can be used.
BASIC ADDERS (Arithmetic Binary Adder)
Parallel Binary Adders
• Two or more full-adders are connected to form parallel binary adders.
• To add two binary numbers, a full-adder is required for each bit in the
numbers. So,
• For 2-bit numbers, two adders are needed
• For 4-bit numbers, four adders are used and so on
• The carry output of each adder is connected to the carry input of the
next higher-order adder.
4-bit Parallel Adders
• A group of four bits a called nibbles.
Magnitude Comparators
• The basic function of a comparator is to compare the magnitude of
two binary quantities to determine the relationship of those
quantities.
• Example 2-bit comparator;
• In its general form, a decoder has n inputs lines to handle n bits and
from 1 to 2n output lines to indicate the presence of one or more n-
bit combinations.