One's complement

From Computer History Wiki
Revision as of 16:48, 12 May 2021 by Jnc (talk | contribs) (Somewhat duplicative of content elsewhere)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search

One's complement is the original system for representing integers (both positive and negative) in binary; if the high bit (the 'sign' bit) is '1', the number is negative; if '0', the remaining bits encode either 0 (if all '0'), or a positive number. 0 has a second representation (sometimes called '-0'), with all bits (including the sign bit) set to '1'.

Negative numbers are formed by taking the positive number, and complementing it (bit-by-bit inversion). So. for example, using a 4-bit word, 1 is '0001'; to get -1, invert, which gives '1110'.