SlideShare a Scribd company logo
3
Most read
4
Most read
5
Most read
SYED HASAN SAEED
hasansaeedcontrol@gmail.com
https://shasansaeed.yolasite.com
1
Syed Hasan Saeed, Integral University,
Lucknow
DECIMAL ADDER
2
Syed Hasan Saeed, Integral University,
Lucknow
BCD ADDER:
A BCD adder should perform the following
• Add two 4-bit BCD number using straight Binary Addition.
• If the sum of two numbers is equal to or less than 9, then the sum is
valid BCD number and no correction is required.
• If the sum of two numbers is greater than 9 or carry is generated
from the sum, then the sum is not valid BCD number. Then add
0110 (6) to the sum, the result will be valid BCD number. If further
a carry is generated then add 0110 to the result.
Syed Hasan Saeed, Integral University,
Lucknow
3
Assume that two 4-bit BCD numbers are being added. In BCD
addition, there are three different cases. Let us consider one by one.
CASE 1: Sum equal to or less than 9 with carry 0
DECIMAL BCD
2 0 0 1 0
+ 3 0 0 1 1
Carry 1
SUM 5 0 0 1 0 1
Syed Hasan Saeed, Integral University,
Lucknow
4
Valid BCD NumberFinal Carry
If the sum of two numbers is less than or equal to 9 with final carry zero,
then the sum is valid BCD number and no correction is required.
Consider second case
Syed Hasan Saeed, Integral University,
Lucknow
5
CASE 2: Sum greater than 9 with carry 0
DECIMAL BCD
5 0 1 0 1
+ 7 0 1 1 1
Carry 1 1
SUM 12 0 1 1 0 0
0 1 1 0
Syed Hasan Saeed, Integral University,
Lucknow
5
Invalid BCD Number
Carry
Add 6 for correction
1 0 0 1 0
0 0 1 00 0 0 1
Final Carry
1 2
Final result
Valid BCD number with
carry 1
If the sum of two numbers is greater than 9 with carry zero , and the sum is
invalid BCD number, then correction is required. Add 0 1 1 0 (6) for correction.
Final result will be the valid BCD number.
Syed Hasan Saeed, Integral University,
Lucknow
6
Syed Hasan Saeed, Integral University,
Lucknow
6
CASE 3: Sum is equal to or less than 9 with carry 1
DECIMAL BCD
8 1 0 0 0
+ 8 1 0 0 0
Carry 1
SUM 16 1 0 0 0 0
0 1 1 0
Syed Hasan Saeed, Integral University,
Lucknow
6
Invalid BCD Number
Add 6 for correction
0 1 1 0
0 1 1 00 0 0 1
Final Carry
1 6
Final result Valid BCD number with
carry 1
If the sum of two numbers is equal to or less than than 9 with carry 1 , and the
sum is invalid BCD number, then correction is required. Add 0 1 1 0 (6) for
correction. Final result will be the valid BCD number.
1
DESIGN:
• In fig. 1 B3B2B1B0 and A3A2A1A0 are the BCD inputs. S3S2S1S0 and
Cout is the output of Adder 1.
• Checked the output of Adder 1, whether it is greater than or less
than 9.
• If the sum of Adder 1 is greater than 9 then the output of
combinational circuit should be 1 (i.e Cout should be high ) and
correction is required.
• Write the truth table and K-Map for combinational circuit.
• The Boolean Expression from K-Map Y= S3S2+S3S1
• The output of combinational circuit Y2 is connected to B2B1 of
Adder 2 and B3B0 are connected to the ground. Therefore B3=B0=0
• The output sum of Adder 1 is connected to Adder 2. the output of
Adder 2 is the final result of BCD addition with Carry which can be
ignored if any.
Syed Hasan Saeed, Integral University,
Lucknow
7
INPUTS OUTPUT
S
S3 S2 S1 S0 Y1
0 0 0 0 0
0 0 0 1 0
0 0 1 0 0
0 0 1 1 0
0 1 0 0 0
0 1 0 1 0
0 1 1 0 0
0 1 1 1 0
1 0 0 0 0
1 0 0 1 0
1 0 1 0 1
1 0 1 1 1
1 1 0 0 1
1 1 0 1 1
1 1 1 0 1
1 1 1 1 1
Syed Hasan Saeed, Integral University, Lucknow
8
SumisvalidBCDnumber.Therefore
Y=0
SumisvalidBCD
number.Therefore
Y=1
TRUTHTABLE K-Map
INPUTS OUTPUT
S
S3 S2 S1 S0 Y1
0 0 0 0 0
0 0 0 1 0
0 0 1 0 0
0 0 1 1 0
0 1 0 0 0
0 1 0 1 0
0 1 1 0 0
0 1 1 1 0
1 0 0 0 0
1 0 0 1 0
1 0 1 0 1
1 0 1 1 1
1 1 0 0 1
1 1 0 1 1
1 1 1 0 1
1 1 1 1 1
Syed Hasan Saeed, Integral University, Lucknow
9
SumisvalidBCDnumber.Therefore
Y=0
SumisvalidBCD
number.Therefore
Y=1
TRUTHTABLE
0 0 0 0
0 0 0 0
1 1 1 1
0 0 1 1
K-Map
S3S2
S1S0
00 01 11 10
10
11
01
00
INPUTS OUTPUT
S
S3 S2 S1 S0 Y1
0 0 0 0 0
0 0 0 1 0
0 0 1 0 0
0 0 1 1 0
0 1 0 0 0
0 1 0 1 0
0 1 1 0 0
0 1 1 1 0
1 0 0 0 0
1 0 0 1 0
1 0 1 0 1
1 0 1 1 1
1 1 0 0 1
1 1 0 1 1
1 1 1 0 1
1 1 1 1 1
Syed Hasan Saeed, Integral University, Lucknow
10
SumisvalidBCDnumber.Therefore
Y=0
SumisvalidBCD
number.Therefore
Y=1
TRUTHTABLE
0 0 0 0
0 0 0 0
1 1 1 1
0 0 1 1
K-Map
S3S2
S1S0
00 01 11 10
10
11
01
00
Y1=S3S2+S3S1
Syed Hasan Saeed, Integral University,
Lucknow
11
0
Output Carry
Cout
Cout
A1 AOA3 A2BO
B1B2B3
SOS1S2S3
SOS1S2S3
Cin
Cin
4-Bit Binary Adder 1
4-Bit Binary Adder 2
S3S1
S3S2
Final Sum Output
Combinational
Circuit
Not To Be Used
Fig.1:BLOCKDIAGRAMOFBCDADDER
Y1
Y2
M3 M2 M1 M0
CASE 1: Sum equal to or less than 9 with carry 0
DECIMAL BCD
2 0 0 1 0
+ 1 0 0 0 1
Carry 0
SUM 3 0 0 0 1 1
Syed Hasan Saeed, Integral University,
Lucknow
12
Valid BCD NumberFinal Carry
Output of combinational circuit Y2= 0, M3 M2 M1 M0 = 0
Output of Adder 2 is same as the output of Adder 1
Syed Hasan Saeed, Integral University,
Lucknow
13
0
Output Carry
Cout
Cout
A1 AOA3 A2BO
B1B2B3
SOS1S2S3
SOS1S2S3
Cin
Cin
4-Bit Binary Adder 1
4-Bit Binary Adder 2
S3S1
S3S2
Final Sum Output
Combinational
Circuit
Not To Be Used
Fig.1:BLOCKDIAGRAMOFBCDADDER
Y1
Y2
0 0 0 10 0 1 0
0
0
0
0
0
0 0 0 0 0 0 1 1
0 0 1 1
M3 M2 M1 M0
Consider second case
Syed Hasan Saeed, Integral University,
Lucknow
14
CASE 2: Sum greater than 9 with carry 0
DECIMAL BCD
5 0 1 0 1
+ 7 0 1 1 1
Carry 1 1
SUM 12 0 1 1 0 0
0 1 1 0
Syed Hasan Saeed, Integral University,
Lucknow
14
Invalid BCD Number
Carry
Add 6 for correction
1 0 0 1 0
0 0 1 00 0 0 1
Final Carry
1 2
Final result
Valid BCD number with
carry 1
Output of combinational circuit Y2= 0, M3 M2 M1 M0 = 0 1 1 0
Syed Hasan Saeed, Integral University,
Lucknow
15
0
Output Carry
Cout
Cout
A1 AOA3 A2BO
B1B2B3
SOS1S2S3
SOS1S2S3
Cin
Cin
4-Bit Binary Adder 1
4-Bit Binary Adder 2
S3S1
S3S2
Final Sum Output
Combinational
Circuit
Not To Be Used
Fig.1:BLOCKDIAGRAMOFBCDADDER
Y1
Y2
0 00 1 1111
1 1 0 0
1 1
1
1
0
0
1
1
0
1 1 000
00 01
2
1000
1
M3 M2 M1 M0
0 1 1 0
Syed Hasan Saeed, Integral University,
Lucknow
16
Syed Hasan Saeed, Integral University,
Lucknow
16
CASE 3: Sum is equal to or less than 9 with carry 1
DECIMAL BCD
8 1 0 0 0
+ 8 1 0 0 0
Carry 1
SUM 16 1 0 0 0 0
0 1 1 0
Syed Hasan Saeed, Integral University,
Lucknow
16
Invalid BCD Number
Add 6 for correction
0 1 1 0
0 1 1 00 0 0 1
Final Carry
1 6
Final result Valid BCD number with
carry 1
1
Output of combinational circuit Y2= 1, M3 M2 M1 M0 = 0 1 1 0
Syed Hasan Saeed, Integral University,
Lucknow
17
0
Output Carry
Cout
Cout
A1 AOA3 A2BO
B1B2B3
SOS1S2S3
SOS1S2S3
Cin
Cin
4-Bit Binary Adder 1
4-Bit Binary Adder 2
S3S1
S3S2
Final Sum Output
Combinational
Circuit
Not To Be Used
Fig.1:BLOCKDIAGRAMOFBCDADDER
Y1
Y2
1 1
1
0 0 0 000
0000
0
0
0
1
1 10 0 00 0 0
1 1 10 0
0 0 0 1
0 1 1 0 61
M3 M2 M1 M0
THANK YOU
Syed Hasan Saeed, Integral University,
Lucknow
18

More Related Content

PPTX
Binary parallel adder
PPT
carry look ahead adder
PPTX
Binary parallel adder
PPTX
halfadder & halfsubtractor using 4:1 MUX
PDF
1d-HALF ADDER & FULL ADDER-PPT.pdf
PPTX
Datapath Design of Computer Architecture
PPTX
Carry look ahead adder
PPTX
1.ripple carry adder, full adder implementation using half adder.
Binary parallel adder
carry look ahead adder
Binary parallel adder
halfadder & halfsubtractor using 4:1 MUX
1d-HALF ADDER & FULL ADDER-PPT.pdf
Datapath Design of Computer Architecture
Carry look ahead adder
1.ripple carry adder, full adder implementation using half adder.

What's hot (20)

PPTX
1s and 2s complement
PDF
Signed Binary Numbers
PPTX
K - Map
PPTX
Logic gates ppt
PPTX
1's and 2's complement
PPT
adder and subtractor
PPTX
Nand and nor as a universal gates
PPTX
Ripple Carry Adder
PDF
Subtractor
PPT
Flip-Flop || Digital Electronics
PPTX
Booth’s algorithm.(a014& a015)
PPT
Bus system
PPTX
Asynchronous Sequential Circuit-Unit 4 ppt
PPTX
Registers
PPTX
PPTX
Complement in DLD
PDF
Error detection & correction codes
PDF
Encoder & Decoder
PDF
Binary codes
1s and 2s complement
Signed Binary Numbers
K - Map
Logic gates ppt
1's and 2's complement
adder and subtractor
Nand and nor as a universal gates
Ripple Carry Adder
Subtractor
Flip-Flop || Digital Electronics
Booth’s algorithm.(a014& a015)
Bus system
Asynchronous Sequential Circuit-Unit 4 ppt
Registers
Complement in DLD
Error detection & correction codes
Encoder & Decoder
Binary codes
Ad

Similar to Decimal adder (20)

PPTX
BCD ADDER - Combinational Circuits of Digital Circuits Design
PPTX
Lecture-5a - Half and Full Adxcccder.pptx
PPTX
COMBINATIONAL CIRCUITS
PPTX
DLD Lecture No 20 Look Ahead Carry Generator, Binary Subtractors and BCD Add...
PPT
Chapter 4 combinational_logic
PDF
Q044067780
PPT
Presentation on bcd adder
PDF
Lecture5 Chapter4- Design Decimal Adder and Binary Multiplier Circuits.pdf
PPTX
Lecture 18 M - Copy.pptx
PPTX
Lecture-5b - BCD Adder and Carry Propagation, Comparator (2).pptx
PPTX
Unit 2.pptx
PPTX
Digital electronics-COMBINATIONAL CIRCUIT DESIGN
PPTX
combinational circuitsand design presentation
PPT
combinational-circuit (1).ppt
PPTX
DIGITAL ELECTRONICS :UNIT-II-COMBINATIONAL CIRCUIT DESIGN
PPTX
UNIT - II.pptx
PDF
Chapter 2
PPTX
Digital principal and computer organization
DOCX
cs 3351 dpco
PDF
FYBSC IT Digital Electronics Unit III Chapter II Arithmetic Circuits
BCD ADDER - Combinational Circuits of Digital Circuits Design
Lecture-5a - Half and Full Adxcccder.pptx
COMBINATIONAL CIRCUITS
DLD Lecture No 20 Look Ahead Carry Generator, Binary Subtractors and BCD Add...
Chapter 4 combinational_logic
Q044067780
Presentation on bcd adder
Lecture5 Chapter4- Design Decimal Adder and Binary Multiplier Circuits.pdf
Lecture 18 M - Copy.pptx
Lecture-5b - BCD Adder and Carry Propagation, Comparator (2).pptx
Unit 2.pptx
Digital electronics-COMBINATIONAL CIRCUIT DESIGN
combinational circuitsand design presentation
combinational-circuit (1).ppt
DIGITAL ELECTRONICS :UNIT-II-COMBINATIONAL CIRCUIT DESIGN
UNIT - II.pptx
Chapter 2
Digital principal and computer organization
cs 3351 dpco
FYBSC IT Digital Electronics Unit III Chapter II Arithmetic Circuits
Ad

More from Syed Saeed (20)

PDF
Laplace transform of periodic functions
PDF
Maximum power transfer theorem for ac network
PDF
Thevenin's theorem for ac network
PDF
Tellegen's theorem
PDF
Millman's theorem
PDF
Subsitution theorem
PPTX
Max. power transfer theorem dc network (Revised)
PDF
Norton's theorem
PDF
Circuit theory thevenin theorem
PDF
Basic definitions & laws revised
PDF
Read only memory(rom)
PDF
PPTX
PPTX
PPTX
PDF
Binary multipliers
PDF
Magnitude comparator
PDF
Quine Mc Clusky (Tabular) method
PPTX
Time domain definition 6
PPTX
Time domain definition 6
Laplace transform of periodic functions
Maximum power transfer theorem for ac network
Thevenin's theorem for ac network
Tellegen's theorem
Millman's theorem
Subsitution theorem
Max. power transfer theorem dc network (Revised)
Norton's theorem
Circuit theory thevenin theorem
Basic definitions & laws revised
Read only memory(rom)
Binary multipliers
Magnitude comparator
Quine Mc Clusky (Tabular) method
Time domain definition 6
Time domain definition 6

Recently uploaded (20)

PDF
Embodied AI: Ushering in the Next Era of Intelligent Systems
PDF
737-MAX_SRG.pdf student reference guides
PDF
PPT on Performance Review to get promotions
PDF
Mohammad Mahdi Farshadian CV - Prospective PhD Student 2026
PDF
Model Code of Practice - Construction Work - 21102022 .pdf
DOCX
573137875-Attendance-Management-System-original
PPTX
CARTOGRAPHY AND GEOINFORMATION VISUALIZATION chapter1 NPTE (2).pptx
PDF
BIO-INSPIRED HORMONAL MODULATION AND ADAPTIVE ORCHESTRATION IN S-AI-GPT
PPTX
FINAL REVIEW FOR COPD DIANOSIS FOR PULMONARY DISEASE.pptx
PPTX
OOP with Java - Java Introduction (Basics)
PDF
Human-AI Collaboration: Balancing Agentic AI and Autonomy in Hybrid Systems
DOCX
ASol_English-Language-Literature-Set-1-27-02-2023-converted.docx
PDF
SM_6th-Sem__Cse_Internet-of-Things.pdf IOT
PDF
keyrequirementskkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk
PPTX
Geodesy 1.pptx...............................................
PPTX
CH1 Production IntroductoryConcepts.pptx
PDF
Operating System & Kernel Study Guide-1 - converted.pdf
PPTX
CYBER-CRIMES AND SECURITY A guide to understanding
PPTX
Safety Seminar civil to be ensured for safe working.
PDF
PREDICTION OF DIABETES FROM ELECTRONIC HEALTH RECORDS
Embodied AI: Ushering in the Next Era of Intelligent Systems
737-MAX_SRG.pdf student reference guides
PPT on Performance Review to get promotions
Mohammad Mahdi Farshadian CV - Prospective PhD Student 2026
Model Code of Practice - Construction Work - 21102022 .pdf
573137875-Attendance-Management-System-original
CARTOGRAPHY AND GEOINFORMATION VISUALIZATION chapter1 NPTE (2).pptx
BIO-INSPIRED HORMONAL MODULATION AND ADAPTIVE ORCHESTRATION IN S-AI-GPT
FINAL REVIEW FOR COPD DIANOSIS FOR PULMONARY DISEASE.pptx
OOP with Java - Java Introduction (Basics)
Human-AI Collaboration: Balancing Agentic AI and Autonomy in Hybrid Systems
ASol_English-Language-Literature-Set-1-27-02-2023-converted.docx
SM_6th-Sem__Cse_Internet-of-Things.pdf IOT
keyrequirementskkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk
Geodesy 1.pptx...............................................
CH1 Production IntroductoryConcepts.pptx
Operating System & Kernel Study Guide-1 - converted.pdf
CYBER-CRIMES AND SECURITY A guide to understanding
Safety Seminar civil to be ensured for safe working.
PREDICTION OF DIABETES FROM ELECTRONIC HEALTH RECORDS

Decimal adder

  • 2. DECIMAL ADDER 2 Syed Hasan Saeed, Integral University, Lucknow
  • 3. BCD ADDER: A BCD adder should perform the following • Add two 4-bit BCD number using straight Binary Addition. • If the sum of two numbers is equal to or less than 9, then the sum is valid BCD number and no correction is required. • If the sum of two numbers is greater than 9 or carry is generated from the sum, then the sum is not valid BCD number. Then add 0110 (6) to the sum, the result will be valid BCD number. If further a carry is generated then add 0110 to the result. Syed Hasan Saeed, Integral University, Lucknow 3
  • 4. Assume that two 4-bit BCD numbers are being added. In BCD addition, there are three different cases. Let us consider one by one. CASE 1: Sum equal to or less than 9 with carry 0 DECIMAL BCD 2 0 0 1 0 + 3 0 0 1 1 Carry 1 SUM 5 0 0 1 0 1 Syed Hasan Saeed, Integral University, Lucknow 4 Valid BCD NumberFinal Carry If the sum of two numbers is less than or equal to 9 with final carry zero, then the sum is valid BCD number and no correction is required.
  • 5. Consider second case Syed Hasan Saeed, Integral University, Lucknow 5 CASE 2: Sum greater than 9 with carry 0 DECIMAL BCD 5 0 1 0 1 + 7 0 1 1 1 Carry 1 1 SUM 12 0 1 1 0 0 0 1 1 0 Syed Hasan Saeed, Integral University, Lucknow 5 Invalid BCD Number Carry Add 6 for correction 1 0 0 1 0 0 0 1 00 0 0 1 Final Carry 1 2 Final result Valid BCD number with carry 1 If the sum of two numbers is greater than 9 with carry zero , and the sum is invalid BCD number, then correction is required. Add 0 1 1 0 (6) for correction. Final result will be the valid BCD number.
  • 6. Syed Hasan Saeed, Integral University, Lucknow 6 Syed Hasan Saeed, Integral University, Lucknow 6 CASE 3: Sum is equal to or less than 9 with carry 1 DECIMAL BCD 8 1 0 0 0 + 8 1 0 0 0 Carry 1 SUM 16 1 0 0 0 0 0 1 1 0 Syed Hasan Saeed, Integral University, Lucknow 6 Invalid BCD Number Add 6 for correction 0 1 1 0 0 1 1 00 0 0 1 Final Carry 1 6 Final result Valid BCD number with carry 1 If the sum of two numbers is equal to or less than than 9 with carry 1 , and the sum is invalid BCD number, then correction is required. Add 0 1 1 0 (6) for correction. Final result will be the valid BCD number. 1
  • 7. DESIGN: • In fig. 1 B3B2B1B0 and A3A2A1A0 are the BCD inputs. S3S2S1S0 and Cout is the output of Adder 1. • Checked the output of Adder 1, whether it is greater than or less than 9. • If the sum of Adder 1 is greater than 9 then the output of combinational circuit should be 1 (i.e Cout should be high ) and correction is required. • Write the truth table and K-Map for combinational circuit. • The Boolean Expression from K-Map Y= S3S2+S3S1 • The output of combinational circuit Y2 is connected to B2B1 of Adder 2 and B3B0 are connected to the ground. Therefore B3=B0=0 • The output sum of Adder 1 is connected to Adder 2. the output of Adder 2 is the final result of BCD addition with Carry which can be ignored if any. Syed Hasan Saeed, Integral University, Lucknow 7
  • 8. INPUTS OUTPUT S S3 S2 S1 S0 Y1 0 0 0 0 0 0 0 0 1 0 0 0 1 0 0 0 0 1 1 0 0 1 0 0 0 0 1 0 1 0 0 1 1 0 0 0 1 1 1 0 1 0 0 0 0 1 0 0 1 0 1 0 1 0 1 1 0 1 1 1 1 1 0 0 1 1 1 0 1 1 1 1 1 0 1 1 1 1 1 1 Syed Hasan Saeed, Integral University, Lucknow 8 SumisvalidBCDnumber.Therefore Y=0 SumisvalidBCD number.Therefore Y=1 TRUTHTABLE K-Map
  • 9. INPUTS OUTPUT S S3 S2 S1 S0 Y1 0 0 0 0 0 0 0 0 1 0 0 0 1 0 0 0 0 1 1 0 0 1 0 0 0 0 1 0 1 0 0 1 1 0 0 0 1 1 1 0 1 0 0 0 0 1 0 0 1 0 1 0 1 0 1 1 0 1 1 1 1 1 0 0 1 1 1 0 1 1 1 1 1 0 1 1 1 1 1 1 Syed Hasan Saeed, Integral University, Lucknow 9 SumisvalidBCDnumber.Therefore Y=0 SumisvalidBCD number.Therefore Y=1 TRUTHTABLE 0 0 0 0 0 0 0 0 1 1 1 1 0 0 1 1 K-Map S3S2 S1S0 00 01 11 10 10 11 01 00
  • 10. INPUTS OUTPUT S S3 S2 S1 S0 Y1 0 0 0 0 0 0 0 0 1 0 0 0 1 0 0 0 0 1 1 0 0 1 0 0 0 0 1 0 1 0 0 1 1 0 0 0 1 1 1 0 1 0 0 0 0 1 0 0 1 0 1 0 1 0 1 1 0 1 1 1 1 1 0 0 1 1 1 0 1 1 1 1 1 0 1 1 1 1 1 1 Syed Hasan Saeed, Integral University, Lucknow 10 SumisvalidBCDnumber.Therefore Y=0 SumisvalidBCD number.Therefore Y=1 TRUTHTABLE 0 0 0 0 0 0 0 0 1 1 1 1 0 0 1 1 K-Map S3S2 S1S0 00 01 11 10 10 11 01 00 Y1=S3S2+S3S1
  • 11. Syed Hasan Saeed, Integral University, Lucknow 11 0 Output Carry Cout Cout A1 AOA3 A2BO B1B2B3 SOS1S2S3 SOS1S2S3 Cin Cin 4-Bit Binary Adder 1 4-Bit Binary Adder 2 S3S1 S3S2 Final Sum Output Combinational Circuit Not To Be Used Fig.1:BLOCKDIAGRAMOFBCDADDER Y1 Y2 M3 M2 M1 M0
  • 12. CASE 1: Sum equal to or less than 9 with carry 0 DECIMAL BCD 2 0 0 1 0 + 1 0 0 0 1 Carry 0 SUM 3 0 0 0 1 1 Syed Hasan Saeed, Integral University, Lucknow 12 Valid BCD NumberFinal Carry Output of combinational circuit Y2= 0, M3 M2 M1 M0 = 0 Output of Adder 2 is same as the output of Adder 1
  • 13. Syed Hasan Saeed, Integral University, Lucknow 13 0 Output Carry Cout Cout A1 AOA3 A2BO B1B2B3 SOS1S2S3 SOS1S2S3 Cin Cin 4-Bit Binary Adder 1 4-Bit Binary Adder 2 S3S1 S3S2 Final Sum Output Combinational Circuit Not To Be Used Fig.1:BLOCKDIAGRAMOFBCDADDER Y1 Y2 0 0 0 10 0 1 0 0 0 0 0 0 0 0 0 0 0 0 1 1 0 0 1 1 M3 M2 M1 M0
  • 14. Consider second case Syed Hasan Saeed, Integral University, Lucknow 14 CASE 2: Sum greater than 9 with carry 0 DECIMAL BCD 5 0 1 0 1 + 7 0 1 1 1 Carry 1 1 SUM 12 0 1 1 0 0 0 1 1 0 Syed Hasan Saeed, Integral University, Lucknow 14 Invalid BCD Number Carry Add 6 for correction 1 0 0 1 0 0 0 1 00 0 0 1 Final Carry 1 2 Final result Valid BCD number with carry 1 Output of combinational circuit Y2= 0, M3 M2 M1 M0 = 0 1 1 0
  • 15. Syed Hasan Saeed, Integral University, Lucknow 15 0 Output Carry Cout Cout A1 AOA3 A2BO B1B2B3 SOS1S2S3 SOS1S2S3 Cin Cin 4-Bit Binary Adder 1 4-Bit Binary Adder 2 S3S1 S3S2 Final Sum Output Combinational Circuit Not To Be Used Fig.1:BLOCKDIAGRAMOFBCDADDER Y1 Y2 0 00 1 1111 1 1 0 0 1 1 1 1 0 0 1 1 0 1 1 000 00 01 2 1000 1 M3 M2 M1 M0 0 1 1 0
  • 16. Syed Hasan Saeed, Integral University, Lucknow 16 Syed Hasan Saeed, Integral University, Lucknow 16 CASE 3: Sum is equal to or less than 9 with carry 1 DECIMAL BCD 8 1 0 0 0 + 8 1 0 0 0 Carry 1 SUM 16 1 0 0 0 0 0 1 1 0 Syed Hasan Saeed, Integral University, Lucknow 16 Invalid BCD Number Add 6 for correction 0 1 1 0 0 1 1 00 0 0 1 Final Carry 1 6 Final result Valid BCD number with carry 1 1 Output of combinational circuit Y2= 1, M3 M2 M1 M0 = 0 1 1 0
  • 17. Syed Hasan Saeed, Integral University, Lucknow 17 0 Output Carry Cout Cout A1 AOA3 A2BO B1B2B3 SOS1S2S3 SOS1S2S3 Cin Cin 4-Bit Binary Adder 1 4-Bit Binary Adder 2 S3S1 S3S2 Final Sum Output Combinational Circuit Not To Be Used Fig.1:BLOCKDIAGRAMOFBCDADDER Y1 Y2 1 1 1 0 0 0 000 0000 0 0 0 1 1 10 0 00 0 0 1 1 10 0 0 0 0 1 0 1 1 0 61 M3 M2 M1 M0
  • 18. THANK YOU Syed Hasan Saeed, Integral University, Lucknow 18