Lecture # 5A - Function of Combinational Logic Final Version

DEPARTMENT OF COMPUTER SCIENCE &
INFORMATION TECHNOLOGY
Logic Design & Switching Theory
Course Code: CS-251

Semester: Spring 2020
Teacher Name: Talha Akhtar
Course Contents
Introduction of Subject
1. Digital fundamentals and Analog Quantities
2. Basic Logic Function & Boolean Algebra
3. Numbers Systems, Operations and Codes
4. Logic Gates
5. Fundamental Theorems of Boolean Algebra
6. Minimization of Boolean Functions
7. Karnaugh map
8. Simplification of Boolean Functions, POS
9. Function of Combinational Logic
10.Latshes, Flip-Flops, and Timmer
Functions of Combinational Logic
Logic circuits for digital systems may be 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. Their outputs are a function of the inputs and the
state of the storage elements.
COMBINATIONAL CIRCUITS
A combinational circuit consists of an interconnection of logic
gates.
Combinational logic gates react to the values of the signals at their

inputs and produce the value of the output signal, transforming
binary information from the given input data to a required output
data.
The n input binary variables come from an external source; the m

output variables are produced by the internal combinational logic
circuit and go to an external destination.
COMBINATIONAL CIRCUITS
Each input and output variable exists physically as an analog signal
whose values are interpreted to be a binary signal that represents
logic 1 and logic 0.
or n input variables, there are 2n possible combinations of the

binary inputs
A combinational circuit also can be described by m Boolean

functions, one for each output variable. Each output function is
expressed in terms of the n input variables.
Binary Adder
The most basic arithmetic operation is the addition of two binary digits. This simple
addition consists of four possible elementary operations:
0 + 0 = 0, 0 + 1 = 1, 1 + 0 = 1 and 1 + 1 = 10.
The first three operations produce a sum of one digit, but when both augend and addend
bits are equal to 1, the binary sum consists of two digits.
The higher significant bit of this result is called a carry .
When the augend and addend numbers contain more significant digits, the carry
obtained from the addition of two bits is added to the next higher order pair of significant
bits.
A combinational circuit that performs the addition of two bits is called a half adder .
One that performs the addition of three bits (two significant bits and a previous carry) is a
full adder. The names of the circuits stem from the fact that two half adders can be
employed to implement a full adder.
Half Adder
The half-adder accept two binary digits on its inputs and produces two binary
digits on its outputs.
The input variables designate the augend and addend bits; the output variables
produce the sum and carry
Half Adder
Half Adder Logic
From the operation of the half-adder, expression can be derived for the sum and
output carry as function of inputs.
The output carry (Cout) is 1 only when A and B is 1. the Cout can be expressed as
the AND of the input variable
Cout = AB
The sum output is a 1 only input variable, are not equal. The sum can be
expressed as the exclusive-OR of the input variables.
Σ=A EXCLISIVE-OR B
Half Adder
Half Adder Logic
Full Adder
A full adder is a combinational circuit that forms the arithmetic sum of three
bits.
It consists of three inputs and two outputs. Two of the input variables, denoted
by x and y , represent the two significant bits to be added. The third input, z ,
represents the carry from the previous lower significant position.
The two outputs are designated by the symbols S for sum and C for carry. The
binary variable S gives the value of the least significant bit of the sum.
The binary variable C gives the output carry formed by adding the input carry
and the bits of the words.
Full Adder
The output variables are determined from the arithmetic sum of the input bits.
When all input bits are 0, the output is 0. The S output is equal to 1 .
when only one input is equal to 1 or when all three inputs are equal to 1. The C
output has a carry of 1 if two or three inputs are equal to 1.
Full Adder
Full Adder Logic
The Full adder must add the two inputs and input carry. From the half-adder you
know that the sum of the input bits A and B is the exclusive-OR of those two
variables, A (exclusive-or) B.
For the input Cin to be added to its input bits it must be exclusive-ored with A
(exclusive-or) B.
Σ = (A EX-OR B) EX-OR Cin

Full Adder
Full Adder
Full Adder Truth table

Parallel Binary Adder
Two or more full-adder are connected to form parallel binary adder.
A single full-adder is capable of adding two 1-bit numbers and an input carry.
To add binary numbers with more than one bit, you must use additional full-
adders.
When one binary numbers is added to another, each column generate a sum bit
and 1 or 0 carry bit to the next column to the left.
1-- carry
11
+ 01
100
sum bit
2-bit parallel adder
To add two binary numbers, a full-adder is required for each bit in the numbers.
2-bit numbers -> two adder are needed.
4-bit numbers -> four adders are used.
The carry output of each adder is connected to the carry input of the next
higher-order adder.
Determine the sum generated by the parallel added. The intermediate carries
when the binary numbers 101 and 011 are being added.
A group of four bit is called a nibble a basic 4-bit parallel adder is implemented
with four full-adder
The LSBs (A1 and B1) in each number being added go into the right-most full-
adder. The MSBs are (A4, B4).
The carry output of each adder is connected to the carry input of the next
higher-order adder.
C0 is the input carry to the least significant bit adder.

C4 is the input carry to the most significant bit adder.
Σ1 -> LSB Sum output
Σ4 -> MSB Sum output
4-bit parallel adder Truth table
Cn-1 AN BN Σn Cn
0 0 0 0 0
0 0 1 1 0
0 1 0 1 0
0 1 1 0 1
1 0 0 1 0
1 0 1 0 1
1 1 0 0 1
1 1 1 1 1
Truth table called function tables or functional truth tables.
n represent the adder bit it can be 1,2,3,4 for 4-bit adder.
Cn-1is the carry from previous adder. Carries C1, C2,C3 are generated internally.
C0 is an external carry input C4 is an output.
Example
A4A3A2A1 = 1100
B4B3B2B1 = 1100
____+__________
11000
4-bit parallel bit adder can be expanded to handle the addition of two 8 bit
number by using 4 bit adders.
END
Q/A

Lecture # 5A - Function of Combinational Logic Final Version

Uploaded by

Lecture # 5A - Function of Combinational Logic Final Version

Uploaded by

DEPARTMENT OF COMPUTER SCIENCE &

Logic Design & Switching Theory

Course Code: CS-251

A combinational circuit consists of logic gates whose outputs at any

In contrast, sequential circuits employ storage elements in addition

Combinational logic gates react to the values of the signals at their

The n input binary variables come from an external source; the m

or n input variables, there are 2n possible combinations of the

A combinational circuit also can be described by m Boolean

Σ = (A EX-OR B) EX-OR Cin

Full Adder Truth table

2-bit numbers -> two adder are needed.

4-bit numbers -> four adders are used.

C0 is the input carry to the least significant bit adder.

You might also like