PRESENTATION FOR DIGITAL AND LOGIC DESIGN.pptx

HassanShahg2 9 views 22 slides Jul 26, 2024
Slide 1
Slide 1 of 22
Slide 1
1
Slide 2
2
Slide 3
3
Slide 4
4
Slide 5
5
Slide 6
6
Slide 7
7
Slide 8
8
Slide 9
9
Slide 10
10
Slide 11
11
Slide 12
12
Slide 13
13
Slide 14
14
Slide 15
15
Slide 16
16
Slide 17
17
Slide 18
18
Slide 19
19
Slide 20
20
Slide 21
21
Slide 22
22

About This Presentation

enjoy


Slide Content

PRESENTATION FOR DIGITAL AND LOGIC DESIGN PRESENTED BY: HAFEEZA MUSTAFA

TOPPIC : HALF ADDER PRESENTED BY: HAFEEZA MUSTAFA

DEFINITION: It is a combinational logic circuit . It is also called two bits adder .

EXPLANATION: We can design it by connecting one AND gate and one XOR gate . A half adder circuit consist of two input terminal namely A and B both of these add two input digits and generate the output . IN form of carry and other output sum .Thus there are two outputs . The output that obtains from the XOR gate is sum of the both bits numbers . The output obtained from AND gate is called carry .

Half adder designing: We can design half adder by using following steps .

TRUTH TABLE :

2 VARIABLE K-MAP FOR SUM AND CARRY:

BOLEAN EXPRESSION:

HALF ADDER DIAGRAM: BY using XOR expression.

TOPPIC : FULL ADDER PRESENTED BY: HAFEEZA MUSTAFA

Definition : Full Adder is the adder which adds three inputs and produces two outputs. The first two inputs are A and B and the third input is an input carry as C-IN. The output carry is designated as C-OUT and the normal output is designated as S which is SUM.

EXPLANATION: A full adder is a circuit that has two AND gates , two EX_OR gates , and one OR gate. The full adder adds three binary digits. Among all the three , one is the carry that we obtain from the previous addition as C_IN , and the two are inputs A and B .

Full Adder Block:

K-Map For Sum:

K-Map For Carry:

Bolean Expression Equation Full Adder :

Deference Of Full Adder :

Application Of Half And Full Adder :
Tags