Two's complement
From Just Solve the File Format Problem
(Difference between revisions)
(Category:Integer formats) |
Dan Tobias (Talk | contribs) |
||
| (One intermediate revision by one user not shown) | |||
| Line 2: | Line 2: | ||
|formattype=electronic | |formattype=electronic | ||
|subcat=Elements of File Formats | |subcat=Elements of File Formats | ||
| + | |wikidata={{wikidata|Q232577}} | ||
}} | }} | ||
'''Two's complement''' is the most common way to represent a signed integer using a fixed number of bits. | '''Two's complement''' is the most common way to represent a signed integer using a fixed number of bits. | ||
| Line 14: | Line 15: | ||
* [[Wikipedia:Two%27s complement|Wikipedia article]] | * [[Wikipedia:Two%27s complement|Wikipedia article]] | ||
| − | [[Category: | + | [[Category:Number formats]] |
Latest revision as of 02:26, 29 May 2019
Two's complement is the most common way to represent a signed integer using a fixed number of bits.
The high bit can be thought of as the sign bit (though this is arguable, as it represents more than just the sign). If the sign bit is 1, the number is negative. If it is 0, the number is positive or zero. Positive numbers use the standard base-2 representation.
To convert a number N to −N, invert all the bits, then add 1, discarding any carry. This works for any number except the maximally negative number, which has no positive equivalent.
The term two's complement also means the operation described above.
