DCD Comb Ckts 2 Online

You might also like

Download as pdf or txt
Download as pdf or txt
You are on page 1of 28

Introduction Combinational Circuits Half Adder Full Adder Half Subtractor Full Subtractor

Digital Circuit Design (18B11EC215)


Combinational Circuits

Prabhanshu Yadav
Asst. Prof.
JIIT, Noida

Sept 20, 2023

Jaypee Institute of Information Technology, Noida

Digital Circuit Design Combinational Circuits 1/26


Introduction Combinational Circuits Half Adder Full Adder Half Subtractor Full Subtractor

Introduction

We have covered two modules -


Introduction to Digital Systems, Binary Codes and Boolean
Algebra.
Boolean Function Representation and Minimization Techniques
Now, we will be focusing on the next two very important
modules -
Combinational Circuits.
Sequential Circuits.

Digital Circuit Design Combinational Circuits 2/26


Introduction Combinational Circuits Half Adder Full Adder Half Subtractor Full Subtractor

Combinational Circuits

A circuit whose output depends only on the present inputs


applied, and has no bearing on the past history of inputs
applied.

Common examples are - Adders, Subtractors, Multiplexer,


De-Multiplexer etc.

3 / 26
Introduction Combinational Circuits Half Adder Full Adder Half Subtractor Full Subtractor

Sequential Circuits

A circuit whose output depends on the present inputs applied


as well as the past history of inputs applied.

Common examples are - Flip-Flops, Counters, registers etc.


4 / 26
Introduction Combinational Circuits Half Adder Full Adder Half Subtractor Full Subtractor

Addition of Two Binary Digits

Circuit used for the addition of two binary digits is known as


Half Adder.
When two binary digits X and Y are added, a sum (S) and
carry (C) is generated.
Half Adder has two inputs and two outputs:
Inputs: Two input bits X and Y.
Outputs: The sum (S) and the carry (C).

5 / 26
Introduction Combinational Circuits Half Adder Full Adder Half Subtractor Full Subtractor

Half Adder

Table 1: Truth Table for Half Adder.

X Y S C

0 0 0 0
0 1 1 0
1 0 1 0
1 1 0 1

S = X .Y ′ + X ′ .Y = X ⊕ Y
C = X .Y

6 / 26
Introduction Combinational Circuits Half Adder Full Adder Half Subtractor Full Subtractor

Design for Half Adder

Block Realization for Half Adder:

Gate Level Realization for Half Adder:

7 / 26
Introduction Combinational Circuits Half Adder Full Adder Half Subtractor Full Subtractor

Question - Analyze this circuit

8 / 26
Introduction Combinational Circuits Half Adder Full Adder Half Subtractor Full Subtractor

Solution

9 / 26
Introduction Combinational Circuits Half Adder Full Adder Half Subtractor Full Subtractor

Steps to Analyze any Circuit

Label down the inputs and outputs.


Write down the expression for the intermediate points and the
outputs.
Draw the truth table.
Deduce the functionality of the circuit.

10 / 26
Introduction Combinational Circuits Half Adder Full Adder Half Subtractor Full Subtractor

Limitation of Half Adder

11 / 26
Introduction Combinational Circuits Half Adder Full Adder Half Subtractor Full Subtractor

Limitation of Half Adder

At every stage we need to perform the addition of 3 bits.


Half Adder can only perfrom the addition of two bits.
Therefore, we need a Full Adder.

12 / 26
Introduction Combinational Circuits Half Adder Full Adder Half Subtractor Full Subtractor

Full Adder

Full Adder has three inputs and two outputs:


Inputs: Two input bits X and Y and the carry in (Z).
Outputs: The sum (S) and the carry out (C).
To add two multi-bit numbers, we can use a cascade of full
adders.
Block level realization of full adder:

13 / 26
Introduction Combinational Circuits Half Adder Full Adder Half Subtractor Full Subtractor

Full Adder
Truth Table and Expression for Full Adder:

X Y Z S 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
S = X ′ .Y ′ .Z + X ′ .Y .Z ′ + X .Y ′ .Z ′ + X .Y .Z = X ⊕ Y ⊕ Z
C = X ′ .Y .Z + X .Y ′ .Z + X .Y .Z ′ + X .Y .Z = Z (X ⊕ Y ) + X .Y
Simplified C = X .Y + Y .Z + X .Z
14 / 26
Introduction Combinational Circuits Half Adder Full Adder Half Subtractor Full Subtractor

Full Adder

15 / 26
Introduction Combinational Circuits Half Adder Full Adder Half Subtractor Full Subtractor

Full Adder

Gate Level Realization of Full Adder:

16 / 26
Introduction Combinational Circuits Half Adder Full Adder Half Subtractor Full Subtractor

Full Adder

17 / 26
Introduction Combinational Circuits Half Adder Full Adder Half Subtractor Full Subtractor

Full Adder

Full adder is made up of 2 half adder + OR gate.


18 / 26
Introduction Combinational Circuits Half Adder Full Adder Half Subtractor Full Subtractor

Half Subtractor

Half subtractor performs the subtraction of two binary digits.


When two binary digits X and Y are subtracted, a difference
and borrow is generated.
Half subtractor has two inputs and two outputs:
Inputs: Two input bits X and Y.
Outputs: Difference (D) and Borrow (B).

19 / 26
Introduction Combinational Circuits Half Adder Full Adder Half Subtractor Full Subtractor

Half Subtractor

Table 2: Truth Table for Half Subtractor.

X Y D B

0 0 0 0
0 1 1 1
1 0 1 0
1 1 0 0

D = X .Y ′ + X ′ .Y = X ⊕ Y
B = X ′ .Y

20 / 26
Introduction Combinational Circuits Half Adder Full Adder Half Subtractor Full Subtractor

Design for Half Subtractor

Block Realization for Half Subtractor:

Gate Level Realization for Half Subtractor:

21 / 26
Introduction Combinational Circuits Half Adder Full Adder Half Subtractor Full Subtractor

Full Subtractor

Full Subtractor has three inputs and two outputs:


Inputs: Two input bits X and Y and the borrow in (Bin ).
Outputs: The difference (D) and the borrow out (Bout ).
To subtract two multi-bit numbers, we can use a cascade of
full subtractors.
Block level realization of full subtractor:

22 / 26
Introduction Combinational Circuits Half Adder Full Adder Half Subtractor Full Subtractor

Full Subtractor
Truth Table and Expression for Full Subtractor:

X Y Bin D Bout

0 0 0 0 0
0 0 1 1 1
0 1 0 1 1
0 1 1 0 1
1 0 0 1 0
1 0 1 0 0
1 1 0 0 0
1 1 1 1 1
D = X ′ .Y ′ .Bin + X ′ .Y .Bin
′ + X .Y ′ .B ′ + X .Y .B = X ⊕ Y ⊕ Z
in in
′ ′ ′
Bout = X .Y .Bin + X .Y .Bin ′ + X ′ .Y .B + X .Y .B =
in in
(X ⊕ Y )′ Bin + X ′ .Y
Simplified Bout = X ′ .Y + X ′ .Bin + Y .Bin
23 / 26
Introduction Combinational Circuits Half Adder Full Adder Half Subtractor Full Subtractor

Full Subtractor

24 / 26
Introduction Combinational Circuits Half Adder Full Adder Half Subtractor Full Subtractor

Full Subtractor

Gate Level Realization of Full Subtractor:

25 / 26
Introduction Combinational Circuits Half Adder Full Adder Half Subtractor Full Subtractor

Full Subtractor

26 / 26
Introduction Combinational Circuits Half Adder Full Adder Half Subtractor Full Subtractor

Full Subtractor

Full subtractor is made up of 2 half subtractor + OR gate.

27 / 26
Introduction Combinational Circuits Half Adder Full Adder Half Subtractor Full Subtractor

Full Subtractor

28 / 26

You might also like