Combinational Logic

 Analysis and Design procedure for Combinational circuits

 Binary adder (Half Adder, Full Adder and Parallel Adder)
 Binary subtractor (Half subtractor, Full subtractor)
 Binary multiplier
 Booth Algorithm
 Magnitude comparator
 Encoder and Decoder
 Multiplexer and Demultiplexer

1
Concept of Combinational Logic Circuits
 Logic gates are connected together to produce a
specific output for certain specified combinations of
input variables, with no storage involved, the
resulting circuits is called combinational logic circuit.
 Output depends only on the current inputs
 Combinational circuits provide a higher level of
abstraction
 Help in reducing design complexity
 Reduce chip count
 We look at some useful combinational circuits. 2
Concept of Combinational Logic Circuits:

 A combinational logic circuit consists of input

variables, logic gates and outputs variables.
 Logic gates accepts the signals from the I/P
variables and generate the O/P signals.

 Design Procedure:
Design of Combinational circuits start from the outlying
of the problem statement and ends in a logic diagram.
3
 Design Procedure
Following Design Steps Involve in Designing a
Combinational Logic Circuits:
(1) Analyze the given problem and identify the number of
inputs and outputs

(2) Assigned the letter symbols to I/P and O/P variables.

(3) Write the truth Table based on the specifications of logic

circuits. T. T. that defines relationship between I/P and O/P.

(4) Determine the simplified expressions for each output by

using K-map.

(5) Draw the logic circuits for obtained output expressions.

4
 Combinational Logic Circuits
Single-Bit Addition

A B A B

Half Adder Cout

Full Adder Cout C

S S

A B Cout S A B C Cout S
0 0 0 0 0 0 0 0 0
0 1 0 1 0 0 1 0 1
1 0 0 1 0 1 0 0 1
1 1 1 0 0 1 1 1 0
1 0 0 0 1
1 0 1 1 0
S  A B
1 1 0 1 0
Cout  A B
S  A B C 1 1 1 1 1
Cout  MAJ ( A, B, C )
 Combinational Circuits

Half Adder:
• Combinational logic circuits
give us many useful devices.
• One of the simplest is the half
adder, which finds the sum of
two bits.
• We can gain some insight as
to the construction of a half
adder by looking at its truth
table, shown at the right.

6
 Combinational Circuits

• Sum can be found using the

XOR operation
• Carry using the AND
operation.

7
 Combinational Circuits

Full Adder:
• We can change our half
adder into to a full adder
by including gates for
processing the carry bit.
• The truth table for a full
adder is shown at the
right.

8
 Combinational Circuits

• How can we change the

half adder shown below to
make it a full adder?

9
 Combinational Circuits

• Here’s our completed full adder.

10
 Combinational Circuits

• Just as we combined half adders to make a full

adder, full adders can connected in series.
• The carry bit “ripples” from one adder to the next;
hence, this configuration is called a ripple-carry
adder.

Today’s systems employ more efficient adders.

11
 Adders
• Half-adder
• Adds two bits
• Produces a sum and carry
• Problem: Cannot use it to build larger inputs
• Full-adder
• Adds three 1-bit values
• Like half-adder, produces a sum and carry
• Allows building N-bit adders
• Simple technique
• Connect Cout of one adder to Cin of the next
• These are called ripple-carry adders
Adders (cont.)
Adders (cont.)
A 16-bit ripple-carry adder
Adders (cont.)
• Ripple-carry adders can be slow
• Delay proportional to number of bits
• Carry lookahead adders
• Eliminate the delay of ripple-carry adders
• Carry-ins are generated independently
• C0 = A0 B0
• C1 = A0 B0 A1 + A0 B0 B1 + A1 B1
•...
• Requires complex circuits
• Usually, a combination carry lookahead and ripple-
carry techniques are used