Autosave: 2024-03-19 07:30:04
This commit is contained in:
parent
790dedf85d
commit
a8b9a01667
1 changed files with 24 additions and 0 deletions
|
@ -12,8 +12,32 @@ created: Tuesday, March 19, 2024
|
||||||
- _Two's complement_ is a method for representing signed numbers (negative
|
- _Two's complement_ is a method for representing signed numbers (negative
|
||||||
integers) in binary.
|
integers) in binary.
|
||||||
|
|
||||||
|
- The two's complement of a given binary integer is its negative equivalent.
|
||||||
|
|
||||||
## Detail
|
## Detail
|
||||||
|
|
||||||
|
### Procedural steps
|
||||||
|
|
||||||
|
Two's complement divides the available word length (see
|
||||||
|
[[Binary_encoding|binary encoding]]) into two subsets: one for negative integrs
|
||||||
|
and one for positive integers.
|
||||||
|
|
||||||
|
Take the binary encoding of decimal five (`0101`). Its complement is `1011`.
|
||||||
|
|
||||||
|
The procedure for deriving the complement is as follows.
|
||||||
|
|
||||||
|
To derive the complement of an unsigned number:
|
||||||
|
|
||||||
|
1. Take the unsigned number and invert its digits: `0` becomes `1`, `1` becomes
|
||||||
|
`0`
|
||||||
|
2. Add one
|
||||||
|
|
||||||
|

|
||||||
|
|
||||||
|
To derive the unsigned equivalent of a signed number
|
||||||
|
|
||||||
|
### Formal expression
|
||||||
|
|
||||||
## Applications
|
## Applications
|
||||||
|
|
||||||
## Related notes
|
## Related notes
|
||||||
|
|
Loading…
Add table
Reference in a new issue