Why is the original code and the reverse complement of the binary positive number the same?

The binary positive number of the original code is the reverse complement of the codeWhy the same?

In computer systems, numerical values are always represented and stored in complements.

In a computer, there is only a complement code, and there is no original code or reverse code.

The original code is reversed, and they areSomething that doesn't exist!

The same, not the same, it doesn't have any effect, you can just say it.

The complement of a positive number does not need to be inverse plus one.

This is the definition.

Negative numbers need to be added by one.

Same.

Positive original code = inverse code = complement. The purpose of introducing complements is to make it easier for computers to do subtraction.

For example: according to the time of 12 hours, the current accurate time is 4 o'clock, there is a table showing 7 o'clock, if you want to calibrate the time, we can set the hour hand back 7-4 = 3 squares, you can also dial forward 12-3 = 9 squares, the computer can do subtraction can be converted into -3 = +9, which can simplify the hardware equipment of the computer to do complex subtraction.

The original code is the complement.

The complement of a positive integer is its binary representation, which is the same as the original code.

Example: The complement of +9 is 00001001. (Note:.)

This +9 complement is represented by 8-bit binary binary, and there are many ways to represent the complement, as well as 16-bit binary complement representation, as well as 32-bit binary complement representation, 64-bit complement representation, etc. Each complement representation can represent only a limited number of numbers. ）

Find the complement of a negative integer, and add 1 to all bits of its original code except for the sign bit (0 becomes 1, 1 becomes 0, and the sign bit is 1 unchanged).

The same number is different in different complement representations. For example, the complement of -15 is 11110001 in 8-bit binary, but in the 16-bit complement representation, it is 1111111111110001. The following are all represented in 8-bit binary.

The above content reference: Encyclopedia - Complement.

Similarly, the original code of a positive number = inverse code = complement code. The purpose of introducing complements is to make it easier for computers to do subtraction.

For example: according to the time of 12 hours, the current accurate time is 4 o'clock, there is a table showing 7 o'clock, if you want to calibrate the time, we can set the hour hand back 7-4 = 3 squares, you can also dial forward 12-3 = 9 squares, the computer can do subtraction can be converted into -3 = +9, which can simplify the hardware equipment of the computer to do complex subtraction.

However, the definition of complement is obtained: a positive number is still positive, and a negative number x is rounded by subtracting | from 2x|。The complement that was introduced in order to simplify subtraction turned out to be subtraction in the process of finding complements.

In this way, the inverse code notation was introduced to facilitate the supplement. The inverse code of the complement code is to simplify the subtraction, the minus sign is turned into a negative number, and then the negative number is turned into a complement to find the addition, which has nothing to do with positive numbers. So whether it is a positive integer or a positive decimal, the original code, the reverse code, and the complement code are all the same.

Origin code is a method of representing the binary points of numbers in a computer. The original code refers to the code obtained by adding the sign bit to the left of a binary number, and when the binary number is greater than 0, the sign bit is 0; When the binary number is less than 0, the sign bit is 1; When the binary number is equal to 0, the sign bit can be either 0 or 1. The original code is the simplest encoding method for the number of signs, which is convenient for input and output, but it is more complicated as an addition and subtraction operation.

Numeric bits represent the absolute value of the truth value. Where there are less than n-1 digits, the decimal is added to the right of the lowest digit; The integer is added to the left of the highest digit to make up the n-1 digit. ** in the decimal point".

It is added for clarity when writing, and does not appear in the machine.

Complement In a computer system, numerical values are always represented and stored by complements. The reason is that, with complements, it is possible to unify the sign bits and numerical fields; At the same time, addition and subtraction can also be handled in a unified manner. In addition, the operation process of the complement and the original code is the same, and no additional hardware circuitry is required.

There are three ways to represent the number of symbols in a computer, namely the original, inverse, and complement. The three representations have two parts, the sign bit is 0 for "positive", 1 for "negative", and the numerical bit is different for the three representations. For computers, the concept and approach are exactly the same.

For n-bit computers, let n=8, the maximum number that can be represented is 11111111, if you add 1 to become 100000000 (9 bits), but because there are only 8 bits, the highest bit 1 is naturally lost. It's back to 00000000, so the modulo of the 8-bit binary system is 2 8. In such a system, the subtraction problem can also be reduced to an addition problem, and the subtraction can be represented by the corresponding complement.

The use of complements in the processing of computer logarithms is called complements.

Inverse code is a type of numerical storage, but because complement is more effective in representing the form of numbers in computers, most computers do not use inverse codes to represent numbers.

Yes, the original code of a positive number is inverse and complement.

Could it be that the "original reversal"?

Isn't that strange?

Not surprising! They don't understand the language in the first place.

Again, in the C language, there is something like this: "i = i + 1;”。

This equation, in the eyes of a math teacher, is certainly not true.

No matter what the value of i is, this "equation" is not an equation.

It can be seen from this that the mathematics of computer science majors is also chaotic.

Who did you learn the basic knowledge of computer experts?

Go without saying.

In computer systems, numerical values are always represented and stored in complement codes.

The original code and the reverse code do not exist in the computer. They are also useless.

The same, or not, doesn't mean anything.

Complement, in fact, is a positive number that "replaces a negative number".

With the use of complements, there are no more negative numbers in the computer.

By the way, subtraction is eliminated.

So, the computer only needs an adder to go all over the world.

How can a complement (i.e., a positive number) be used instead of a negative number?

The theoretical basis lies in the periodicity of the counting system.

For example,2-digit decimal number (0 99)., the counting cycle is

So: 25 1 = 24

25 + 99 = one hundred) 24

As long as you:Discard carrying,With only 2 digits, 99 can be used instead of 1.

In the same way, 98 can be used instead of 2.

These positive numbers are called "complements of negative numbers".

Transformation formula: Complement of negative periods.

In addition, turning back the hour hand for 3 hours and going forward for 9 hours is equivalent, the period is 12.

2, +3 2, positive and negative angles, also equivalent, the period is 2.

The transformation formula is all the same.

computer,For an 8-digit base number, the period is 2 8 = 256.

The complement of 1 is: 1 + 256= 255 = 1111 1111 (binary).

The complement of 2 is:254 = 1111 1110 (binary).

To find the complement, you don't have to go through the "original code reverse code to add a sign bit unchanged".

Foreigners who are not good at math need to do what kind of tricks!

Only negative numbers need to be transformed into complements (positive numbers).

Positive numbers do not need to be transformed, nor are they allowed to be transformed, they must be added directly.

So, if it's positive, it doesn't have a complement.

Some people say, "Positive... It's all the same.

This is being taken into the ditch by a foreigner.

The original code is reversed, and it doesn't exist, how can there be anything equal!

In computers, negative numbers are expressed as "the complement form of their positive values".

Computers, and do not use the original and reverse codes.

After using the complement, the computer has no negative numbers and no subtraction.

Then, the computer only needs to configure an adder, and the world is rampant!

Positive, it's already positive!

Zeros and positive numbers do not need to be transformed, nor are they allowed to be transformed, and must be calculated directly.

So, positive numbers, there is no "any yard" at all.

In addition, in the computer, there is no original code and reverse code.

Same, not the same?

What's the point of discussing this!

The original code and complement of a positive number are the same, so the complement of a binary number complement is its original code.

In a computer, there are three representations of fixed points: original, inverse, and complement.

Original code: is the binary point notation, that is, the highest bit is the sign bit, "0" means positive, "1" table Yu Tong search negative, and the rest of the bits represent the size of the value.

Inverse code: The notation stipulates that the inverse code of a positive number is the same as its original code; The inverse of a negative number is the inversion of its original code bit by bit, except for the sign bits.

Complement: The notation stipulates that the complement of a positive number is the same as its original code; The complement of the negative number is to add 1 to the last digit of the reverse code of the jujube.

？？？Complement of Complement ??? There is only "complement of numbers".

How can there be a "complement of complements"! Destroy the famine.

What you mean by fiber return is probably "add one to the complement again", right?

After learning the computer, people can't talk and fight.

Numerical values, in computer systems, are always represented and stored in complements.

In computers, both the original code and the reverse code do not exist.

You just need to master the interchange of "numeric and complementary", and you're good to go.

When the code is eight digits long:Zeros and positive numbers, no transformation. A negative number, plus 256, is the complement.

The original code is reversed and added to the sign bit unchanged, these, what are they for?

Foreigners are not good at math and can't figure out the conversion formula, so they need to do some tricks.

Frame shifting, limited applications.

In C, the original code and the reverse complement of positive numbers are the same.

The symbol bit is 0, the original code, the reverse code, the complement code: 00001010;

Complement is a method that is conceived for negative numbers, with the aim that subtraction can be achieved by adding complements. The complement can be obtained by adding 1 to the reverse code, so there is a negative number of the reverse code.

There is a hardware "adder" in the computer, and with the complement, subtraction can also be done with an adder. The computing speed in the computer, the hardware is much faster than the software, which is the reason for the inverse code, the complement code and the original code.