DIGITAL LOGIC DESIGN

Combinational Circuit Design

 CONTENTS

Module-2

 Binary adder and subtractor

 Ripple carry adders/subtractors and fast adders
 Binary decoders, encoders
 Multiplexers and de-multiplexers
 Logic functions using decoders and multiplexers
 Code converters
 Magnitude comparator

Combinational Circuit Design 2

 CONTENTS

Lecture-1

 Combinational Circuit Design

 Binary adder and subtractor
 Half Adder
 Full Adder
 Half Subtractor
 Full Subtractor

Number Systems 3
Combinational Circuit
Design

Combinational Circuit Design 4

 COMBINATIONAL CIRCUIT DESIGN

 Logic circuits in digital may be of two types: Combinational and sequential.

 A combinational circuit consists of logic gates whose output is depending upon the present input
values. (Implemented by a set of Boolean functions)
 However, sequential circuit depend on both present and past values of inputs.

 Each input and output variables represent an analog signal whose values are treated as logic 1 or
logic 0.
 For n input variables, there are 2n possible combinations of the binary inputs with 2n possible
outputs. Thus, a combinational circuit can be specified with a truth table.

Combinational Circuit Design 5

 COMBINATIONAL CIRCUIT DESIGN

Analysis of a Combinational Circuit:

 The analysis of a combinational circuit is carried out to find the Boolean function of the circuit.
 Procedure to obtain the Boolean function:
 Label all gate outputs that are a function of input variables with arbitrary symbols— but with
meaningful names. Determine the Boolean functions for each gate output.
 Label the gates that are a function of input variables and previously labeled gates with other
arbitrary symbols. Find the Boolean functions for these gates.
 Repeat the process outlined in step 2 until the outputs of the circuit are obtained.
 By repeated substitution of previously defined functions, obtain the output Boolean functions
in terms of input variables.

Combinational Circuit Design 6

 COMBINATIONAL CIRCUIT DESIGN

 Analyze the following circuit

1 T1
4 T4
T2
2
5
T3
3

𝑻 𝟏= 𝑨𝑩 ′ 𝑻 𝟑=𝑪+ 𝑫 ′
𝑻 𝟐= 𝑨′ 𝑩 ′
𝑻 𝟒=𝑻 𝟏+ 𝑻 𝟐= 𝑨 𝑩 + 𝑨 𝑩
′

Combinational Circuit Design 7

 COMBINATIONAL CIRCUIT DESIGN

Design Procedure of a Combinational Circuit:

 The procedure involves the following steps:
 From the specifications of the circuit, determine the required number of inputs and outputs and
assign a symbol to each.
 Derive the truth table that defines the required relationship between inputs and outputs.
 Obtain the simplified Boolean functions for each output as a function of the input variables.
 Draw the logic diagram and verify the correctness of the design (manually or by simulation).

Combinational Circuit Design 8

 COMBINATIONAL CIRCUIT DESIGN

Example: Design a combinational circuit with 3 inputs whose output is equal to 1 if the
number of inputs has more 1’s than 0’s.

Step-1: Here, the total number of inputs = 3 and total number of outputs = 1
Step-2: Truth Table
x y z F
0 0 0 0
0 0 1 0
0 1 0 0
0 1 1 1
F = Σ (3, 5, 6, 7)
1 0 0 0
1 0 1 1
1 1 0 1
1 1 1 1

Combinational Circuit Design 9

 COMBINATIONAL CIRCUIT DESIGN

Step-3: Minimize F using K-Map Step-4: Design the circuit:

F = Σ (3, 5, 6, 7)
yz
yz
00 01 11 10
x
0 1
𝑭
1 1 1 1

xz xy

𝑭 =𝒙𝒚 +𝒚𝒛+ 𝒙𝒛
Combinational Circuit Design 10
Adder/Subtractor

Combinational Circuit Design 11

 HALF ADDER

 A half adder is a logic circuit

that adds two binary bits.
 From the truth table the
sum S and carry C can be
obtained as

 The logic diagram of the

half adder implemented in
sum of products.

Combinational Circuit Design 12

 MULTIBIT ADDER

 Consider single-bit adder for each bit position

A3 A2 A1 A0 B3 B2 B1 B0

A 0 1 0 1 B 0 1 1 1

1 1 1 Ci+1 Ci
A 0 1 0 1 Ai
B 0 1 1 1 +Bi
1 1 0 0 Si
Each bit position creates a sum and carry

Combinational Circuit Design 13

 FULL ADDER

 A full adder is a combinational circuit that forms the arithmetic

sum of 3 bits.
 As half adders do not handle carries, the full adder will take
the three bits, i.e., augend, addend and another bit carry.
 The K-map for sum S can be obtained as

yz
00 01 11 10
x
1 1 ′ ′ ′ ′ ′ ′
0 𝑺=𝒙 𝒚 𝒛 +𝒙 𝒚 𝒛 +𝒙 𝒚 𝒛 +𝒙𝒚𝒛
1 1 1
′
¿ ′ ′ ′
¿ 𝒙 (𝒚 ¿ ′ 𝒛 +𝒚 𝒛 )+ 𝒙( 𝒚 𝒛 +𝒚𝒛)¿
′
¿ 𝒙 ( 𝒚 ⊕ 𝒛 ) + 𝒙 ( 𝒚 ⊕ 𝒛 )= 𝒙 ⊕ 𝒚 ⊕ 𝒛
Combinational Circuit Design 14
 FULL ADDER

 Similarly, the K-map for C can be obtained as

yz
yz
00 01 11 10
x
0 1

1 1 1 1

xz xy

𝑪=𝒙𝒚 + 𝒚𝒛+ 𝒙𝒛

Combinational Circuit Design 15

 FULL ADDER

 Similarly, the circuits for S and C can be obtained as

Combinational Circuit Design 16

 FULL ADDER

 The full adder circuit can be designed by using two half adders with one OR gate

Half adder-1 Half adder-2

Combinational Circuit Design 17

 FULL ADDER

 The S output from the second half adder is the exclusive-OR of z and the output of the first
half adder, giving

 The carry output is

Combinational Circuit Design 18

 FULL ADDER

 The generalized block diagram is given as

Combinational Circuit Design 19

 HALF SUBTRACTOR

 A half subtractor is a logic

circuit that subtracts two
binary bits.
 From the truth table the
difference D and borrow B
can be obtained as

 The logic diagram of the half

subtractor implemented in
sum of products.

Combinational Circuit Design 20

 FULL SUBTRACTOR

 A full subtractor is a combinational circuit that forms the

arithmetic subtraction of 3 bits.
 As half subtractors do not handle borrows, the full subtractor
will take the three bits, i.e., Minuend, Subtrahend and another
bit borrow.
 The K-map for difference D can be obtained as

yz
00 01 11 10
x
1 1 ′ ′ ′ ′ ′ ′
0 𝑫= 𝒙 𝒚 𝒛 +𝒙 𝒚 𝒛 +𝒙 𝒚 𝒛 +𝒙𝒚𝒛
1 1 1
′
¿ ′ ′ ′
¿ 𝒙 (𝒚 ¿ ′ 𝒛 +𝒚 𝒛 )+ 𝒙( 𝒚 𝒛 +𝒚𝒛)¿
′
¿ 𝒙 ( 𝒚 ⊕ 𝒛 ) + 𝒙 ( 𝒚 ⊕ 𝒛 )= 𝒙 ⊕ 𝒚 ⊕ 𝒛
Combinational Circuit Design 21
 FULL SUBTRACTOR

 Similarly, the K-map for B can be obtained as

yz
yz
00 01 11 10
x
0 1 1 1

1 1

x'z x'y

𝑩= 𝒙 ′ 𝒚 +𝒚𝒛 +𝒙 ′ 𝒛

Combinational Circuit Design 22

 FULL SUBTRACTOR

 Similarly, the circuits for D and B can be obtained as

Combinational Circuit Design 23

 FULL SUBTRACTOR

 The full subtractor circuit can be designed by using two half subtractors with one OR gate.

Half subtractor-2

z
D
x
y
B

Half subtractor-1

Combinational Circuit Design 24

Combinational Circuit Design 25