<<< Binary Arithmetic     Index     Overflow Detection Circuit for Unsigned Addition >>>

3. Adding Unsigned Numbers


  1. Let's first solve the problem for addition of one-bit quntities:

         0 + 0 =  0
         0 + 1 =  1
         1 + 0 =  1
         1 + 1 = 10
    
  2. When multi-bit unsigned quantities are added, overflow occurrs if there is a carry out from the leftmost (most significant) bit.

     


<<< Binary Arithmetic     Index     Overflow Detection Circuit for Unsigned Addition >>>