补码反码（Complement complement）.doc

补码反码（Complement complement） The original code, complement, complement Numbers are expressed in binary form in a computer. Numbers are divided into signed and unsigned numbers. The original code, complement, complement is a symbol of fixed-point representation. The highest bit of a signed point is the symbol bit, 0 is positive, and 1 is a pair. Here are 8 bit integers, The original code is the number of binary form. for example 0000001 is +1 1000001 is -1 The positive and negative complement are the same and the original code. negative In a computer, a negative number is expressed in the complement of its positive value. What is called complement? This is from the original code, one speaks. Source: an integer in absolute size is converted to a binary number, called the original code. For example, 0000000000000000 of the original 0000000000000101 is 5. Complement: the binary number by bit reverse, the new binary number known as the original binary code. Take counter operation means: originally 1, get 0; originally 0, get 1. (1 change 0, 0 change 1) For example: take 0000000000000000, 0000000000000101, each for 1111111111111111, 1111111111111010. Said: 1111111111111111 1111111111111010 0000000000000000 0000000000000101s complement. Complement each other, so it can be called: 1111111111111111 1111111111111010 and 0000000000000000 0000000000000101 mutual complement is the complement of the source outside except the sign bit you reverse [-3] anti = anti Complement negative is the source outside except the sign bit you reverse after last plus 1. [-3] complement, =, complement, A number and its complement are reversible. Why do we have to establish twos complement? The first is to allow the computer to perform subtraction: [a-b] complement, =a complement + (-b) complement The second reason is to unify the positive 0 and the negative 0 Positive Zero:Negative zero:The two number is 0, but they have different represen