Two's complement representation allows the use of binary arithmetic operations on signed integers, yielding the correct 2's complement results.

A two's-complement system or two's-complement arithmetic is a system in which negative numbers are represented by the two's complement of the absolute value; this system is the most common method of representing signed integers on computers.In such a system, a number is negated (converted from positive to negative or vice versa) by computing its two's complement. An N-bit two's-complement numeral system can represent every integer in the range −2N-1 to +2N-1-1.

For more information you can refer the following website

http://en.wikipedia .org/ wiki/Two's_complement

Answered by Shobhit , an ibibo Master, at 4:10 PM on June 26, 2008

Two's complement representation allows the use of binary arithmetic operations on signed integers, yielding the correct 2's complement results.

A two's-complement system or two's-complement arithmetic is a system in which negative numbers are represented by the two's complement of the absolute value; this system is the most common method of representing signed integers on computers.In such a system, a number is negated (converted from positive to negative or vice versa) by computing its two's complement. An N-bit two's-complement numeral system can represent every integer in the range −2N-1 to +2N-1-1.

For more information you can refer the following website

http://en.wikipedia .org/ wiki/Two's_complement

Answered by Raksha , an ibibo Master, at 8:41 AM on June 26, 2008

Two's complement representation allows the use of binary arithmetic operations on signed integers, yielding the correct 2's complement results.

A two's-complement system or two's-complement arithmetic is a system in which negative numbers are represented by the two's complement of the absolute value; this system is the most common method of representing signed integers on computers.In such a system, a number is negated (converted from positive to negative or vice versa) by computing its two's complement. An N-bit two's-complement numeral system can represent every integer in the range −2N-1 to +2N-1-1.

For more information you can refer the following website

http://en.wikipedia .org/ wiki/Two's_complement

Answered by Ashish Yadav , an ibibo Wizard, at 4:13 PM on June 25, 2008

hi,

The two's complement of a binary number is defined as the value obtained by subtracting the number from a large power of two (specifically, from 2N for an N-bit two's complement).

A two's-complement system or two's-complement arithmetic is a system in which negative numbers are represented by the two's complement of the absolute value;[1] this system is the most common method of representing signed integers on computers.[2] In such a system, a number is negated (converted from positive to negative or vice versa) by computing its two's complement. An N-bit two's-complement numeral system can represent every integer in the range −2N-1 to +2N-1-1.

The two's-complement system is ubiquitous today because it doesn't require that the addition and subtraction circuitry examine the signs of the operands to determine whether to add or subtract, making it both simpler to implement and capable of easily handling higher precision arithmetic. Also, 0 has only a single representation, obviating the subtleties associated with negative zero, which exists in ones'-complement systems.

The method of complements can also be applied in base-10 arithmetic, using ten's complements by analogy with two's complements
for more inf check source http://en.wikipedia.org/wiki/Two's_ complement

Answered by Ajay Pal , an ibibo Master, at 5:59 AM on June 02, 2008

Two's complement representation allows the use of binary arithmetic operations on signed integers, yielding the correct 2's complement results.

A two's-complement system or two's-complement arithmetic is a system in which negative numbers are represented by the two's complement of the absolute value; this system is the most common method of representing signed integers on computers.In such a system, a number is negated (converted from positive to negative or vice versa) by computing its two's complement. An N-bit two's-complement numeral system can represent every integer in the range −2N-1 to +2N-1-1.

For more information you can refer the following website

http://en.wikipedia.org/ wiki/Two's_complement

Answered by chandragiris , an ibibo Citizen, at 11:05 AM on May 31, 2008

Hi there

The key to understanding the arithmetic unit is to see that counting and adding are obviously related. One simple way to add two numbers would be to include a second counter, into which we could set the addend. Count the addend down, while counting the augend up. But that takes awhile. Worse yet, to keep things synchronized we have to have one marble ripple through both counters (even though its path is different when a bit is 0 or 1).

A much better approach, and the one implemented, would be to add the same way we might do by hand: Add the 1's column to the 1's column, the 2's column to the 2's column, and so forth. Done this way, we only need one marble for each bit, not one per count.

It is well known that the 2's complement code sytem is advantageous in that the negative numbers can be easily expressed and operated so that the consistency for both the addition and subtraction can be used fruitfully in operating the numbers.

subtraction of two binary numbers, all the bits of an addend are added to the corresponding bits of the 2's complement number of the binary number to be added. It should be noticed in advance that a 2's complement number can be obtained by adding 1 to the 1's complement of a number. This relation can be expressed as follows;
A-B=A+(-B)=A+B+1
In the meantime, in the case where 2'S complement codes are multiplied, the 2'S complement codes are divided into a sign and an absolute value (magnitude of the code) and the absolute value is multiplied first and then the sign is corrected separately.

Answered by Reeta K , an ibibo Master, at 5:18 PM on May 30, 2008

a digital signal processing system does not always deal with positive values. For instance, considering a case that an A/D (analog to digital) converter converts an analog input data into a digital signal to obtain a new value by subtracting so-converted digital signals, when a subtraction of A-B is implemented, if the value A is bigger than the value B the output will be positive, where the output data is, of course, valid.

However, if the value A is smaller than the value B the output data will be negative, an invalid value.

Therefore, it is understood that the digital code data must be able to deal with not only the positive value (number) but also the negative value. In practice, to meet this end the conventional digital signal processing system adopts various code systems.To this end, a signed-magnitude code can be used, which has an extra bit for indicating whether the value of the code is positive or negative. This code system is divided into a part for indicating the absolute value of the code and another part for indicating the sign value thereof.

The so-called 2's complement code system can also be used. The basic principle of this 2's complement code is to use the concept of the complement numbers.

Being consistently calculable both for addition and subtraction, this code system is widely used in general digital signal processing systems.

In a general digital signal processing system, the same result can be obtained regardless of the code system. When, however, a very high frequency (maybe, tens of MHz) is used for the operating clock, the various characteristics, particularly the speed characteristic of the digital signal processing system is strongly dependent upon the code system.


According to the substantial digital signal processing system, the construction can be regarded as a combination of an adder, a subtractor, a multiplier and a divider, all of which is for processing correspondingly the input data code (for example, the straight code, the signed-magnitude code or the 2's complement code).

It is well known that the 2's complement code sytem is advantageous in that the negative numbers can be easily expressed and operated so that the consistency for both the addition and subtraction can be used fruitfully in operating the numbers.

subtraction of two binary numbers, all the bits of an addend are added to the corresponding bits of the 2's complement number of the binary number to be added. It should be noticed in advance that a 2's complement number can be obtained by adding 1 to the 1's complement of a number. This relation can be expressed as follows;
A-B=A+(-B)=A+B+1
In the meantime, in the case where 2'S complement codes are multiplied, the 2'S complement codes are divided into a sign and an absolute value (magnitude of the code) and the absolute value is multiplied first and then the sign is corrected separately.

Answered by Sharad Singh , an ibibo Master, at 1:48 PM on May 30, 2008

well yikes, The two's complement of a binary number is defined as the value obtained by subtracting the number from a large power of two (specifically, from 2N for an N-bit two's complement).

A two's-complement system or two's-complement arithmetic is a system in which negative numbers are represented by the two's complement of the absolute value;[1] this system is the most common method of representing signed integers on computers.[2] In such a system, a number is negated (converted from positive to negative or vice versa) by computing its two's complement. An N-bit two's-complement numeral system can represent every integer in the range −2N-1 to +2N-1-1. It is well known that the 2's complement code sytem is advantageous in that the negative numbers can be easily expressed and operated so that the consistency for both the addition and subtraction can be used fruitfully in operating the numbers.

subtraction of two binary numbers, all the bits of an addend are added to the corresponding bits of the 2's complement number of the binary number to be added. It should be noticed in advance that a 2's complement number can be obtained by adding 1 to the 1's complement of a number. This relation can be expressed as follows;
A-B=A+(-B)=A+B+1
In the meantime, in the case where 2'S complement codes are multiplied, the 2'S complement codes are divided into a sign and an absolute value (magnitude of the code) and the absolute value is multiplied first and then the sign is corrected separately.

Answered by Romi , an ibibo Master, at 7:16 PM on May 29, 2008

well Bikers, Therefore, it is understood that the digital code data must be able to deal with not only the positive value (number) but also the negative value. In practice, to meet this end the conventional digital signal processing system adopts various code systems.

To this end, a signed-magnitude code can be used, which has an extra bit for indicating whether the value of the code is positive or negative. This code system is divided into a part for indicating the absolute value of the code and another part for indicating the sign value thereof.

The so-called 2's complement code system can also be used. The basic principle of this 2's complement code is to use the concept of the complement numbers. Being consistently calculable both for addition and subtraction, this code system is widely used in general digital signal processing systems.

In a general digital signal processing system, the same result can be obtained regardless of the code system. When, however, a very high frequency (maybe, tens of MHz) is used for the operating clock, the various characteristics, particularly the speed characteristic of the digital signal processing system is strongly dependent upon the code system.

Division was done in the usual fashion, by subtracting rather than adding the multiplicand. Because division requires us to know when the subtraction has gone far enough, there was a gadget to sense overflow of the high bit.

1. The problem statement, all variables and given/known data

a.) What is the lowest number represented by a 12-bit machine using Sign Magnitude?

b.) What is the largest?

c.) What decimal number does the bit pattern "101001010010" represent?


2. Relevant equations

For a and b:

Signed integer ranges for N bits (I don't know if this is what I need to use):

Lowest: -[2^(N-1) - 1]

Highest: [2^(N-1) - 1]

3. The attempt at a solution

a.) -[2^(N-1) - 1]
-[2^(12-1) - 1]
-[2^(11) -

Answered by Uttam , an ibibo Master, at 2:15 PM on May 29, 2008

hello bikers The two's complement of a binary number is defined as the value obtained by subtracting the number from a large power of two (specifically, from 2N for an N-bit two's complement).

A two's-complement system or two's-complement arithmetic is a system in which negative numbers are represented by the two's complement of the absolute value;[1] this system is the most common method of representing signed integers on computers.[2] In such a system, a number is negated (converted from positive to negative or vice versa) by computing its two's complement. An N-bit two's-complement numeral system can represent every integer in the range −2N-1 to +2N-1-1.

The two's-complement system is ubiquitous today because it doesn't require that the addition and subtraction circuitry examine the signs of the operands to determine whether to add or subtract, making it both simpler to implement and capable of easily handling higher precision arithmetic. Also, 0 has only a single representation, obviating the subtleties associated with negative zero, which exists in ones'-complement systems.

The method of complements can also be applied in base-10 arithmetic, using ten's complements by analogy with two's complements
for more inf check source http://en.wikipedia.org/wiki/Two's_ complement

Answered by raj u , an ibibo Master, at 12:55 PM on May 29, 2008