one’s complement arithmetic : Java Glossary

home page go to the Java Glossary Home go to the Computer Buyer’s Glossary up local find full screen, hide local find menu Google search web for more information on this topic jump to foot of page translate this page with Babelfish punctuation 0-9 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z (all) ©1996-2012 Roedy Green, Canadian Mind Products
one’s complement arithmetic
Java internally uses (or emulates) two’s complement arithmetic for integers. Some hardware architectures, particularly older ones, use one’s complement arithmetic. Positive numbers are stored in binary. That means that for example the number 13 would be written 0x0d = 00001101 = 1*8 + 1*4 + 0*2 + 1*1. The high order bit is called the sign bit. For signed quantities such as byte, short int and long, when that high order bit is a 1, we consider the number negative. To represent a negative number we simply invert each bit. We would write -13 this way: 0x0d ⇒ 00001101 ⇒ 11110010 ⇒ 0xf2. Whenever you do any operation on a byte, it is first sign extended to an int. Don’t confuse one’s complement with one’s compliments — your aggregate flattering activities.
binary
two’s complement arithmetic
~
CMP homejump to top You can get the freshest copy of this page from: or possibly from your local J: drive (Java virtual drive/mindprod.com website mirror)
http://mindprod.com/jgloss/onescomplement.html J:\mindprod\jgloss\onescomplement.html
logofeedback Please email your feedback for publication, letters to the editor, errors, omissions, typos, formatting errors, ambiguities, unclear wording, broken/redirected link reports, suggestions to improve this page or comments to Roedy Green : feedback email If you want your message kept confidential, not considered for posting, please explicitly specify that.
mindprod.com IP:[65.110.21.43]
view BlogYour face IP:[38.107.179.213]
You are visitor number 11.