Unit II

Combinational Circuits
 Overview
• Design and Implementation
– Half and Full Adders
– Half and Full Subtractors
– Binary Parallel Adder
– Multiplexer & Demultiplexer
– Magnitude Comparator
– Decoder
– Encoder, Priority Encoder
 Lecture – 1
• Design and Implementation
– Half and Full Adders
– Half and Full Subtractors
– Binary Parallel Adder
– Carry Look Ahead Adder
– BCD Adder
– Multiplexer & Demultiplexer
– Magnitude Comparator
– Decoder
– Encoder, Priority Encoder
 Session Objective
• At the end of this session, students will be able to design and
implement half adder and full adder circuits
 Logic Circuits
• Logic Circuits
– Combinational or Sequential
• Combinational Logic Circuits
“A combinational logic circuit consists of logic gates
whose outputs at any time are determined from only the
present combination of inputs”
– It performs an operation that can be specified logically by a set
of Boolean functions.
– Examples: Adder circuits, Code converters, etc.

'n' inputs Combinational 'm' outputs

. .
.
.
Circuit .
.
 Logic Circuits
• Sequential Logic Circuits
“A sequential logic circuit consists of logic gates whose outputs
depend not only on present values of inputs, but also on past
inputs”
– Sequential logic circuits employ storage elements in addition
to logic gates to store the state of the past inputs.
– The circuit behaviour must be specified by a time sequence of
inputs and internal states.
– Examples: Registers, Counters, etc

Inputs Combinational
Circuit Outputs
Memory
Elements
Feedback path
 Logic Circuits
• Logic Circuit Design
– Input: Specifications – word description
– Output: Optimized logic diagram
• Design Procedure
1. From the given specifications,
a) Identify the number of inputs & outputs and Assign arbitrary (letter)
symbols to the inputs & outputs
b) Draw the block diagram.
2. Derive a truth table that defines the relationship between the
inputs and outputs.
In a truth table, if we have ‘n’ inputs then there will be 2n possible
input combinations
3. Obtain simplified Boolean expression for each output as a
function of the input variable.
4. Implement with logic diagram.
 Logic Circuits
• Design Constraints
– In designing a combinational circuit certain constraints are to
be considered.
• Minimum no. of gates must be used.
• Minimum no. of inputs must be given to the gates.
• Circuit should have minimum no. of interconnections.
• The propagation time of the signals through the gate should be
minimum.
 Adders
• Binary adder–subtractor
– A combinational circuit that performs the arithmetic operations
of addition and subtraction with binary numbers.
– Half Adder
– Full Adder
– Half Subtractor
– Full Subtractor
 Half Adder
• Half adder
– This circuit needs two binary inputs and two binary outputs.
– Step 1: Derive block diagram
• The input variables designate the augend and addend bits
• The output variables produce the sum and carry.
• Assign symbols A and B to the two inputs and Sum Carry to the
outputs.
 Half Adder
• Half adder
– Step: 2 Derive the truth table

– Step: 3 Obtain minimized Boolean equation

Sum  AB  AB  A  B
 Half Adder
• Half adder
– Step: 3 Obtain minimized Boolean equation

Carry  AB

– Step-4: Draw the logic diagram

 Full Adder
• Full Adder
– The difference between a half-adder and a full-adder is that the
full-adder has three inputs and two outputs, whereas half adder
has only two inputs and two outputs.
– Step 1: Derive the block diagram
• Addition of n-bit binary numbers requires the use of a full adder, and
the process of addition proceeds on a bit-by-bit basis, right to left,
beginning with the least significant bit.
• After the least significant bit, addition at each position adds not only the
respective bits of the words, but must also consider a possible carry bit
from addition at the previous position.
 Full Adder
• Full Adder
– Step 1: Derive the block diagram
• 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 xi and yi , represent the two
significant bits to be added.
– The third input ci , represents the carry from the previous lower
significant position.
• Two outputs are necessary because the arithmetic sum of three binary
digits ranges in value from 0 to 3, and binary representation of 2 or 3
needs two bits.
– The two outputs are designated by the symbols ‘s’ for sum and
‘ci+1’ for carry.
 Full Adder
• Full Adder
– Step 1: Derive the block diagram

xi s

yi Full Adder
ci+1
ci
 Full Adder
• Design Example – Full Adder
– Step 2: Derivation of truth table that defines the relationship
between the inputs and outputs

0 0 0 0 0

0 0 1 0 1

0 1 0 0 1

0 1 1 1 0

1 0 0 0 1

1 0 1 1 0

1 1 0 1 0

1 1 1 1 1
xi Full Adder
• Design Example – Full Adder
– 3: Obtaining simplified Boolean expression for each output as
a function of the input variable
xiyi xiyi
ci ci
 Full Adder
• Design Example – Full Adder
– 4: Implementation with logic diagram
xi
si
yi

ci

ci+1
 Full Adder
• Design Example – Full Adder
– 4: Implementation with logic diagram

si
 Full Adder
• Using two half adders
– The half adder adds two input bits and generates a carry and sum, which are
the two outputs of a half adder.
– With the addition of an OR gate to combine their carry outputs, two half
adders can be combined to make a full adder.

xi
yi si

ci+1

ci
 Session Conclusion
• In this lecture we have discussed
– Design and implementation of half adder and full adder
circuits
 Review Questions
1. What are combinational logic circuits?
2. What are sequential logic circuits?
3. What is half adder?
4. What is full adder?
5. Design and implement half adder using logic gates.
6. Design and implement full adder using logic gates.
 References
1. M. Morris Mano and Michael D. Ciletti, “Digital Design”, 5th
Edition, Pearson, 2014
2. S.Salivahanan and S.Arivazhagan“Digital Electronics”, 5th Edition,
Oxford University Press 2017.
3. Charles H.Roth. “Fundamentals of Logic Design”, 6th Edition,
Thomson Learning, 2013.
4. Thomas L. Floyd, “Digital Fundamentals”, 10th Edition, Pearson
Education Inc, 2011
5. Anil K.Maini “Digital Electronics”, Wiley, 2014.
6. A.Anand Kumar “Fundamentals of Digital Circuits”, 4th Edition, PHI
Learning Private Limited, 2016.
7. Soumitra Kumar Mandal “ Digital Electronics”, McGraw Hill
Education Private Limited, 2016.