MODULE 2: Combinational

circuits
HALF ADDERS
THEORY: A half adder has two inputs for the two bits to be added and
two outputs one from the sum ‘ S’ and other from the
carry ‘ c’ into the higher adder position.

TRUTH TABLE:

INPUT OUTPUT
A B SUM(S) CARRY( C )
0 0 0 0
0 1 1 0
1 0 1 0
1 1 0 1
DESIGN

INPUT OUTPUT
A B SUM(S) CARRY( C )
0 0 0 0
0 1 1 (minterm =A’B) 0
1 0 1 (minterm =AB’) 0
1 1 0 1 (minterm=AB)

Boolean Equation:

SUM : S=A’B+AB’ (EX-OR GATE)

CARRY: C=AB
CIRCUIT DIAGRAM:
FULL ADDERS
 A full adder is a combinational circuit that forms the arithmetic
THEORY:
sum of input; it consists of three inputs and two outputs. A full
adder is useful to add three bits at a time but a half adder
cannot do so.

TRUTH TABLE:

A B Cin Sum (S) Carry (C out )

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
 DESIGN
A B Cin Sum (S) Carry (C out )
0 0 0 0 0
0 0 1 1(minterm=A’B’C) 0
0 1 0 1(minterm=A’BC’) 0
0 1 1 0 1(minterm=A’BC)
1 0 0 1(minterm=AB’C’) 0
1 0 1 0 1(minterm=AB’C)
1 1 0 0 1(minterm=ABC’)
1 1 1 1(minterm=ABC) 1(minterm=ABC)

𝑆𝑢𝑚: 𝑆 = 𝐴ҧ 𝐵𝐶 ҧ 𝑖𝑛 + 𝐴𝐵𝐶
ത 𝑖𝑛 + 𝐴𝐵𝐶 ത 𝑖𝑛 + 𝐴𝐵𝐶𝑖𝑛 = 𝐴 𝐵 𝐶𝑖𝑛

ҧ 𝑖𝑛 + 𝐴𝐵𝐶
𝐶𝑎𝑟𝑟𝑦 𝑜𝑢𝑡 : 𝐶𝑜𝑢𝑡 = 𝐴𝐵𝐶 ҧ + 𝐴𝐵
ത 𝑖𝑛 + 𝐴𝐵𝐶𝑖𝑛 + 𝐴𝐵𝐶𝑖𝑛 = 𝐶𝑖𝑛 𝐴𝐵ത + 𝐴𝐵 = 𝐴 𝐵 𝐶𝑖𝑛 + 𝐴𝐵 (Form 1)

𝐶𝑜𝑢𝑡 = 𝐴𝐵 + 𝐵𝐶𝑖𝑛 + 𝐴𝐶𝑖𝑛 (Form 2)

CIRCUIT DIAGRAM (Using Form 1 for Cout )
FULL ADDER USING HALF ADDERS
(Using Form 1 for Cout )
FULL ADDER USING HALF ADDERS
Parallel Adders
PARALLEL ADDERS
4 bit Parallel Adder
4 bit Parallel Adder
Serial Adder
4 bit Serial Adder
Difference
between
Serial and
Parallel
Adders
Difference
between
Serial and
Parallel
Adders
MULTIPLEXERS
 MULTIPLEXERS

Analogous example: A multiplex (referring cinema), where there are multiple screens featuring different movies.
Multiplexer
DEMULTIPLEXERS
e.g. A single computer connected to 4 different printers (B/W, colour, LaserJet, Xerox and printer
machine) and taking output from one at a time.
DEMULTIPLEXER CIRCUIT
BCD to 7 Segment Display
BCD to 7 segment Display
IMPLEMENTATION OF CONTROL FUNCTION using
MULTIPLEXERS/

MULTIPLEXERS AS LOGIC FUNCTION GENERATOR

 Implement f(A, B, C) = Y = ∑ m (1, 3,5, 6) using 8×1 MUX
Step 1: Draw the truth table Step 2: Check the number Step 3: Draw the specified MUX
corresponding to the given of select lines available for • Assign the select lines with input
number of input variables the specified MUX variables from logic function.
• Assign the input lines with the
output of the logic function.
Your text here
For 8x1 MUX, there are 8 =
23 𝑖𝑛𝑝𝑢𝑡 𝑙𝑖𝑛𝑒𝑠 and to
select each of the input,
A B C there are 3 select lines. 0 I0
1 I1
If number of select lines is equal 0 I2
to the number of variables, use I3 Y
1
the value of output Y from truth
0 I4.
table to assign to each of the
1 I5
input pins of MUX
1 I6
No. of input variables = No. of 0 I7 S2 S1 S0
select lines = 3
A B C
Implement f(A, B, C) = Y = ∑ m (0, 1, 2, 6, 7) using 4×1 MUX
with AB as the select line
Step 1: Draw the truth table Step 2: Check the number Step 3: Prepare an implementation
corresponding to the given of select lines available for table.
number of input variables the specified MUX
AB
00 01 10 11
Your text here C
0 0 2 4 6
For 4 x1 MUX, there are 4
= 22 𝑖𝑛𝑝𝑢𝑡 𝑙𝑖𝑛𝑒𝑠 and to
select each of the input, 1 3 5 7
A B C 1
there are 2 select lines.
1
1 If number of select lines is not
1 equal to the number of 1 C 0 1
0 variables, First prepare an
0 implementation table.
0
1
1
No. of input variables = 3
No. of select lines = 2
 Implement f(A, B, C) = Y = ∑ m (0, 1, 2, 6, 7) using
4×1 MUX with AB as the select line

Rules for extracting inputs from the implementation table:

• Write the select line inputs on the top, and its combinations that
can be extracted from it as each column name.
• Write the remaining input variables, on the bottom side, with its *Refer notes to
combination as each row name. learn how to
• Depending on the combination of bits, put the number generated draw the MuX
as a value of each cell. with inputs
• Encircle the numbers which are present as “1” in the output Y.
• Look at each column for each input pin. Follow the rules
mentioned below:

1. If both the cells are encircled, then consider the output of that
column as “1”.
2. If none of the cells are encircled, then consider the output of
that column as “0”.
3. If one of the cell is encircled, then look at the third variable and
output is either the variable (if it is 1) or its complemented form (if it
is 0).
Refer notes for further information