Two's complement - Revision history

Dan Tobias at 02:26, 29 May 2019

2019-05-29T02:26:10Z

Jsummers: Category:Number formats

2017-09-16T15:35:24Z

Category:Number formats

Jsummers: Category:Integer formats

2017-08-23T19:26:59Z

Category:Integer formats

Jsummers: Changed primary category

2015-12-05T14:15:47Z

Changed primary category

Jsummers at 20:53, 2 June 2013

2013-06-02T20:53:11Z

Jsummers: Created page with "{{FormatInfo |formattype=electronic |subcat=Binary Data }} '''Two's complement''' is the most common way to represent a signed integer using a fixed number of bits. The high ..."

2013-04-18T00:29:26Z

Created page with "{{FormatInfo |formattype=electronic |subcat=Binary Data }} '''Two's complement''' is the most common way to represent a signed integer using a fixed number of bits. The high ..."

New page

{{FormatInfo
|formattype=electronic
|subcat=Binary Data
}}
'''Two's complement''' is the most common way to represent a signed integer using a fixed number of bits.

The high bit is used as the sign bit. 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.

== Resources ==
* [[Wikipedia:Two%27s complement|Wikipedia article]]

← Older revision		Revision as of 15:35, 16 September 2017
Line 14:		Line 14:
	* [[Wikipedia:Two%27s complement\|Wikipedia article]]		* [[Wikipedia:Two%27s complement\|Wikipedia article]]

−	[[Category:~~Integer~~ formats]]	+	[[Category:Number formats]]

← Older revision		Revision as of 19:26, 23 August 2017
Line 14:		Line 14:
	* [[Wikipedia:Two%27s complement\|Wikipedia article]]		* [[Wikipedia:Two%27s complement\|Wikipedia article]]

−	[[Category:~~Binary Data~~]]	+	[[Category:Integer formats]]

@@ Line 2: / Line 2: @@
 |formattype=electronic
 |subcat=Elements of File Formats
 }}
 '''Two's complement''' is the most common way to represent a signed integer using a fixed number of bits.

@@ Line 1: / Line 1: @@
 {{FormatInfo
 |formattype=electronic
-|subcat=Binary Data
+|subcat=Elements of File Formats
 }}
 '''Two's complement''' is the most common way to represent a signed integer using a fixed number of bits.
@@ Line 13: / Line 13: @@
 == Resources ==
 * [[Wikipedia:Two%27s complement|Wikipedia article]]

@@ Line 5: / Line 5: @@
 '''Two's complement''' is the most common way to represent a signed integer using a fixed number of bits.
-The high bit is used as the sign bit. 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.
+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.