0% found this document useful (0 votes)
119 views

Hardware Tutorial Solution 07

This document discusses generating binary-coded decimal (BCD) sums from binary sums larger than 1001. When the binary sum is larger than 1001, 10 is subtracted from the sum since the 4-bit twos-complement of 10 is 0110, which is added to the binary number to generate the correct BCD sum for all numbers between 10 and 19.

Uploaded by

Taqi Shah
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
119 views

Hardware Tutorial Solution 07

This document discusses generating binary-coded decimal (BCD) sums from binary sums larger than 1001. When the binary sum is larger than 1001, 10 is subtracted from the sum since the 4-bit twos-complement of 10 is 0110, which is added to the binary number to generate the correct BCD sum for all numbers between 10 and 19.

Uploaded by

Taqi Shah
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Tutorial 7: Solution Problem 1

Problem 2

Problem 3
In order to generate the BCD sum from the binary sum when the sum is larger than 1001 (9) we have to subtract 10. The 4 bit twos-complement of 10 is 6, so we add the binary number 0110 (6) and this works for all numbers between 10 and 19.

DOC112: Computer Hardware Tutorial 7

You might also like