written 8.0 years ago by | • modified 8.0 years ago |
Mumbai University > Computer Engineering > Sem 3 > Digital Logic Design and Analysis
Marks: 10M
Year: Dec 2016
written 8.0 years ago by | • modified 8.0 years ago |
Mumbai University > Computer Engineering > Sem 3 > Digital Logic Design and Analysis
Marks: 10M
Year: Dec 2016
written 8.0 years ago by | • modified 8.0 years ago |
To implement BCD adder we require:
• 4-bit binary adder for initial addition
• Logic circuit to detect sum greater than 9
• One more 4-bit adder to add $0110_{2}$ in the sum if sum is greater than 9 or carry is 1
Y=1 indicates sum is greater than 9. We can put one more term, C_out in the above expression to check whether carry is one.
If any one condition is satisfied we add 6(0110) in the sum.
With this design information we can draw the block diagram of BCD adder, as shown in figure below.
As shown in the Fig, the two BCD numbers, together with input carry, are first added in the top 4-bit binary adder to produce a binary sum.
When the output carry is equal to zero (i.e. when sum <= 9 and C_out = 0) nothing (zero) is added to the binary sum.
10.When it is equal to one (i.e. when sum > 9 or C_out = 1), binary 0110 is added to the binary sum through the bottom 4-bit binary adder.
The output carry generated from the bottom binary adder can be ignored, since it supplies information already available at the output carry terminal.