BINARY SUBTRACTION
1 like820 views
This document discusses binary subtraction and multiplication. It provides 4 rules for binary subtraction: 0-0=0, 0-1=1, 1-0=1, and 1-1=0. An example of binary subtraction is shown subtracting 10010 from 10110 with a difference of 00100. Binary multiplication is also covered, noting the multiplier is always 1 or 0, and the 4 basic rules are: 0x0=0, 0x1=0, 1x0=0, and 1x1=1. An example of binary multiplication is shown multiplying 10001111 by 1101000 to get a product of 1101.
BINARY SUBTRACTION
- 1. College of science Department of computer Prepared by : vanya rebwar Lecturer : karwan mahdi Applied Logic Circuit
- 2. BINARY SUBTRACTION Binary Subtraction Subtraction and borrow, these two words will be used very frequently for the binary subtraction. There are four rules of binary subtraction: 0 – 0 = 0 0 – 1 = 1 , (borrow 1 from the next more significant bit) 1 – 0 = 1 1 – 1 = 0
- 3. BINARY SUBTRACTION Example Borrow: 00000 00110 Minuend: 10110 10110 Subtrahend: - 10010 - 10011 Difference 00100 00011
- 4. AND A FULL EXAMPLE And more ripple -
- 5. BINARY MULTIPLICATION The multiplication operation is quite simple. The multiplier digits are always 1 or 0. Therefore, the partial products are equal either to the multiplicant or to 0. Rules of Binary multiplication 0 x 0 = 0 0 x 1 = 0 1 x 0 = 0 1 x 1 = 1 (no carry or borrow bits)