Download presentation
Presentation is loading. Please wait.
Published byEduard Krämer Modified over 6 years ago
1
XOR Function Logic Symbol Description Truth Table
Boolean Expression Output Y is TRUE if input A and input B are different A B Y XOR Equivalent Expression Y = Y =
2
XNOR Function Output Y is FALSE if input A and input B are different.
Logic Symbol Description Truth Table Boolean Expression A B Y XNOR Equivalent Expression Y = Y =
3
Half & Full Adders Half Adder Full Adder
4
Half & Full Adders The block diagrams represent a Full-Adder and a Half-Adder. A single bit binary adder circuit basically adds two bits and a carry bit, generated by the addition of the least significant bits. The output of the single bit adder circuit generates a sum bit and a carry bit. An adder circuit that only has two bit input representing the two single bit numbers A and B and does not have the carry bit input from the least significant digit is regarded as a half-adder. An adder circuit that has three inputs, two bits representing the two single bit numbers A and B, and the third bit represents the Carry in bit is regarded as a full-adder
5
Half-Adder Function Table Expression Logic Circuit
6
Half-Adder Function Table
Input Output A B Sum Carry Out 1
7
Half-Adder Circuit
8
Full-Adder Function Table Expression Logic Circuit
9
Full-Adder Function Table
Input Output A B Carry In (C) Sum Carry Out 1
10
Sum Expression
11
Carry Out Expression
12
Full-Adder Circuit
13
Full-Adder based on Two Half-Adders
Full-Adder = Half-Adder + Half-Adder
14
Parallel Binary Adder Multiple Single bit Full-Adder connected in Parallel
15
4-bit Parallel Adder 1010 0011 ____________ 1101
Similar presentations
© 2025 SlidePlayer.com. Inc.
All rights reserved.