Binary Subtraction

Subtraction is generally simpler than addition since only two numbers are involved and the upper value representation is greater than the lower value representation. The problem of "borrow" is similar in binary subtraction to that in decimal. We can contruct a subtraction table that has two parts - the three cases of subtracting without borrow, and the one case of the involvement of a borrow digit, no matter how far to the left is the next available binary digit.

A
B
A-B
One digit cases
0
0
0
1
0
1
1
1
0
The One case of Borrow
10...0
1
original = 01...1
and
result = 1


EXAMPLE



Considerations:

[Prev][TOC][Next]


Last updated 2002/02/06
© J.A.N. Lee, 2000-2002.