PRICIPLES OF ELECTRONIC

ENGINEERING
EN 23001
MRM Rouzin Azar
BSc Eng. (Hons)
 Digital Circuits
Combinational Logic Circuits

Content:
Half Adder

Full Adder

Multiplexer
 Comparison between Combinational Circuits and
Sequential Circuits
1.Combinational Circuits 2.Sequential Circuits
m outputs
n inputs

Combinational Combinational
Circuit Circuit

m outputs
n inputs Memory
Element
1.Present Outputs depends on the present 1.Present Outputs depends on the present
inputs inputs and past outputs
2. It doesn’t consist of memory elements 2.It consists of memory elements
3. It consists of Logic gates. 3.It consists of Logic gates, Flip Flops and
4. Adders, Subtractors, Multiplexers, etc. Clock pulse
4.Flip Flops, Shift Registers, etc.
Designing Steps: The design procedure for
combinational logic circuits starts with the problem
statement, ends at logic circuits diagram and comprises the
following steps:

1.Determine required number of inputs and outputs from

the specifications.
2.Derive the truth table for each of the outputs based on
their relationships to the input.
3.Simplify the boolean expression for each output. Use
Karnaugh Maps or Boolean algebra.
4.Draw a logic diagram that represents the simplified
Boolean expression. Verify the design by analysing or
simulating the circuit.
Half Adder

✓ Half adder is a combinational logic circuit with two

inputs and two outputs.
✓ It is a basic building block for addition of two single
bit numbers.

A Sum

Inputs Half Outputs

B
Adder
Carry
Half Adder

Truth Table for Half Adder

Input Output

A B Sum (S) Carry (C)

0 0 0 0

0 1 1 0

1 0 1 0

1 1 0 1
Half Adder
K-map for Sum Output:
A
A A
B 0 1
S = AB + AB
0 0 1
B
S = A B
B 1 1 0

K-map for Carry Output:

A
A A
B 0 1

B 0 0 0 C = AB

B 1 0 1
Half Adder

Logic Diagram:

A
S = A B
B

C = AB
Half Adder
Logic Diagram using Basic Gates:

A B

S = A B

C = AB
Full Adder

✓Full adder is a combinational logic circuit with

three inputs and two outputs.

A Sum

Inputs Full Outputs

Adder
B Carry

Cin
Full Adder
Truth Table
Inputs Outputs
A B Cin Sum (S) Carry (C)
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
Full Adder
K-map for Sum Output:

BC BC BC BC BC
00 01 11 10
A S = ABC + ABC + ABC + ABC
0 1 0 1
A 0 S = ABC + ABC + ABC + ABC
A 1 1 0 1 0 S = C( AB + AB) + C( AB + AB)
Let AB + AB = X
ABC
ABC ABC
ABC  S = C( X ) + C( X )
S = C X
Let X = A B
S = C  A B
Full Adder

K-map for Carry Output:

BC BC BC BC BC
A 00 01 11 10

0 0 1 0
A 0
C = AB + BC + AC
A 1 0 1 1 1

BC
AB
AC
Full Adder
Logic Diagram:

A B C

S = A B  C

C = AB + BC + AC
Full Adder using Half Adders

A S0 S1 Sum
HA1 HA2
B C0 C1

C
Carry
Multiplexers

✓Multiplexer is a circuit which has a number of

inputs but only one output.

✓Multiplexer is a circuit which transmits large

number of information signals over a single line.

✓Multiplexer is also known as “Data Selector” or

MUX.
Necessity of Multiplexers
✓ In most of the electronic systems, the digital data is
available on more than one lines. It is necessary to route
this data over a single line.
✓ Under such circumstances we require a circuit which
select one of the many inputs at a time.
✓ This circuit is nothing but a multiplexer. Which has many
inputs, one output and some select lines.
✓ Multiplexer improves the reliability of the digital system
because it reduces the number of external wired
connections.
Advantages of Multiplexers

✓ It reduces the number of wires.

✓ So it reduces the circuit complexity and cost.

✓ We can implement many combinational circuits using
Mux.

✓ It simplifies the logic design.

✓ It does not need the k-map and simplification.

Applications of Multiplexers

✓ It is used as a data selector to select one out of many

data inputs.

✓ It is used for simplification of logic design.

✓ It is used in data acquisition system.

✓ In designing the combinational circuits.

✓ In D to A converters.

✓ To minimize the number of connections.

 Block Diagram of Multiplexer

D0 D0
D1 D1
Data D2 D2
Inputs D3 Y
D3
. n:1 .
. .
. Mux Output .
. . Output
. .
Dn-1 Dn-1
E
Enable Input
. . .. . . ..

Sm-1 S2 S1 s0 Sm-1 S2 S1 s0
Select Lines

Fig. General Block Diagram Fig. Equivalent Circuit

Relation between Data Input Lines & Select Lines

✓ In general multiplexer contains , n data lines,

one output line and m select lines.

✓ To select n inputs we need m select lines such

that 2m=n.
Types of Multiplexers

✓ 2:1 Multiplexer

✓ 4:1 Multiplexer

✓ 8:1 Multiplexer

✓ 16:1 Multiplexer

✓ 32:1 Multiplexer

✓ 64:1 Multiplexer

and so on…………
2:1 Multiplexer

D0
Data
2:1 Y
Inputs D1
Mux Block Diagram
Output
E
Enable Input
s
Select Lines
Enable i/p Select i/p Output
(E) (S) (Y)

0 X 0

Truth Table 1 0 D0

1 1 D1
Realization of 2:1 Mux using gates

S D1 D0
S

SD0
Y

Output
SD 1
E
Enable Input
 4:1 Multiplexer

Block Diagram Truth Table

Output
Enable i/p Select i/p
D0
D1 E S1 S0 Y
Data
Y
Inputs D2 4:1
Mux 0 X X 0
D3 Output
D0
1 0 0
E
1 0 1 D1
Enable Input
S1 S0
1 1 0 D2
Select Lines
D3
1 1 1
Realization of 4:1 Mux using gates
S1 S0

S1S 0D0
D0
S1S 0 D 1
D1 Y

Output
D2
S1S 0D2
E
D3 S1S 0 D3 Enable Input
 8:1 Multiplexer
Block Diagram
Truth Table

D0
Outp
D1 Enable
Select i/p ut
i/p
D2
D3 E S2 S1 S0 Y
Data
Y
Inputs D4 8:1 0 X X X 0
Mux Output 1 0 0 0 D0
D5
1 0 0 1 D1
D6
1 0 1 0 D2
D7
1 0 1 1 D3
1 1 0 0 D4
E
1 1 0 1 D5
Enable Input
1 1 1 0 D6
S2 S1 S0 1 1 1 1 D7
Select Lines
THANK YOU