Base Conversion: Binary and Hexadecimal

Base Conversion

It's pretty easy to write code to extract the bits of an integer, and print them out.

/* Print the low 32 bits of this number */
void print_binary(int v) 
{
	for (int bit=31;bit>=0;bit--) {
		if ((v&(1<<bit))!=0) {
			std::cout<<"1";
		} else {
			std::cout<<"0";
		}
	}
	std::cout<<" binary\n";
}

int foo(void) {
	print_binary(6);
	return 0;
}

(executable NetRun link)

It's also pretty easy to stick together a set of bits (say, in an array) into an integer:

const int bits[]={1,1,0};
int nbits=sizeof(bits)/sizeof(bits[0]); /*<- funky trick to find size of static array!*/
int value=0;
for (int bit=0;bit<nbits;bit++) {
	if (bits[nbits-1-bit]) /*<- gotta index the bit array starting at the end */
		value = value | (1<<bit);
}
return value;

(Try this in NetRun now!)

Or you can do the same binary-to-integer conversion using digits from cin:

void print_binary(int v) {
	for (int i=0;i<32;i++)
	{
		int mask=1<<(32-1-i);
		if ((v&mask)==0) std::cout<<"0";
		else std::cout<<"1";
	}
	std::cout<<endl;
}
int read_binary(void) {
	int v=0;
	while (std::cin) {
		char c='?'; 
		std::cin>>c;
		//std::cout<<"I just read the character '"<<c<<"'."<<endl;
		if (c=='0') { 
			/* zero digit in that place */
			v=v<<1; 
		} else if (c=='1') {
			/* one digit in that place */
			v=(v<<1)+1;
		}
		else {
			break;
		}
	}
	return v;
}

int foo(void) {
	return read_binary();
}

(Try this in NetRun now!)

What's the deal with all this hex?

Humans have used the "place/value" number system for a long time--the Sumerians used base-60 in 4000BC! (Base-60 still shows up in our measurement of time (hours have 60 minutes, which have 60 seconds) and angles (360 degrees)). The Maya used base 20. The world standard, though, is now base 10 using Arabic numerals. For example, I'm 31 = 3 * 10 + 1 years old.

But every computer built today uses binary--1's and 0's--to do its work. The reason is electrical--0 is no voltage, 1 is voltage. Having just two states makes it easy to build cheap and reliable circuits; for example, a transistor will threshold the input value and either conduct or not conduct. A single zero or one is called a "bit".

OK, so we got 1's and 0's: how to we build bigger numbers? The modern standard method is using "binary", which is just the place-value system using base 2. In binary, 1 means 1; 10 (base 2) means 2 (base 10); 100 (base 2) means 4 (base 10); 1000 (base 4) means 8 (base 10); 10000 (base 2) means 16 (base 10); and so on. Every machine produced today supports direct binary arithmetic.

Decimal: Base-10	10ⁱ	...	10000	1000	100	10	1
Binary: Base-2	2ⁱ	...	16 = 2⁴	8 = 2³	4 = 2²	2	1
Hex: Base-16	16ⁱ	...	65536 = 2	4096 = 16³	256 = 16²	16	1
Base-n	nⁱ	...	n⁴	n³	n²	n	1 = n⁰
Place/bit Number	i	...	4	3	2	1	0

Sadly, (for a human!) writing or reading binary is really painful and error-prone for large numbers. For example, one million is 11110100001001000000 (base 2), which is painful to write or read. So instead, we often use a larger base. Back in the 1970's, it was pretty common to use octal (base 8), but the modern standard is hexadecimal--base 16. Base 16's gotta use 16 different digits, and there are only 10 arabic numerals, so we use normal alphabet letters for the remaining digits. For example, 15 (base 10) is just F (base 16); an one million in hex is F4240 (base 16). You've got to be careful about the base, though--the string "11" would be interpreted as having the value 1*2+1=3 if it was base 2, the usual 1*10+1=11 if it was base 10, or 1*16+1=17 in base 16!

Decimal	Hex	Binary
0	0	0
1	1	1
2	2	10
3	3	11
4	4	100
5	5	101
6	6	110
7	7	111
8	8	1000
9	9	1001
10	A	1010
11	B	1011
12	C	1100
13	D	1101
14	E	1110
15	F	1111
16	10	10000

Hexadecimal-to-decimal and binary table.

Note that a single digit in base 16 corresponds to exactly 4 bits, since 16=2*2*2*2. This means it's easy to convert from a binary number to a hex number: take groups of 4 bits and convert to a hex digit--or back again: take each hex digit and expand out to the 4 bits it represents. For example, 0xF036 is, in binary, 1111000000110100, because you can match up the place-values like this:

Hex Place-Value	16³				16²				16				1=16⁰
Hex Digit	F				0				3				6
Binary Digit	1	1	1	1	0	0	0	0	0	0	1	1	0	1	1	0
Binary Place-Value	2¹⁵	2¹⁴	2¹³	2¹²	2¹¹	2¹⁰	2⁹	2⁸	2⁷	2⁶	2⁵	2⁴	2³	2²	2¹	2⁰

Hex really is the only true universal in assembly and disassembly. For example, here's some random disassembled code (produced using "objdump -drC -M intel /bin/ls" on a Linux machine):

 804a516:       80 fa 3f                cmp    dl,0x3f
 804a519:       0f 84 7c 01 00 00       je     804a69b <exit@plt+0xc2b>

Note that every single number is listed in hex--the addresses, on the left; the machine code, in the middle; and the constants in the assembly, on the right. A binary file display tool is called a "hex dump". A binary file editor is called a "hex editor". That's how common hex is, so for the rest of the class to make sense, you've gotta learn it!

Hex & Bitwise Operations

Remember that every hex digit represents four bits. So if you shift a hex constant by four bits, it shifts by one entire hex digit:
    0xf0d<<4 == 0xf0d0
    0xf0d>>4 == 0xf0

Bitwise operators make perfect sense working with hex digits, because they operate on the underlying bits of those digits:
    0xff0 & 0x0ff == 0x0f0
    0xff0 | 0x0ff == 0xfff
    0xff0 ^ 0x0ff == 0xf0f

You can use these bitwise operators to peel off the hex digits of a number, to print out stuff in hex:

int v=1024+15;
for (int digit=7;digit>=0;digit--) {
	char *digitTable="0123456789abcdef";
	int d=(v>>(digit*4))&0xF;
	std::cout<<digitTable[d];
}
std::cout<<std::endl;
return v;

(Try this in NetRun now!)

Arithmetic Version of Bitwise Operations

Think about what "X<<1" does to the bits of an integer: what was in the 1's place is now in the 2's place, 2's are shifted to 4's place, 4 is shifted to 8's place, etc. That is, all the bits are now in places worth twice as much as before, so the overall integer is worth twice as much as before: "(X<<1) == (X*2)". In general, left-shifting by n bits is a fast way to multiply by 2ⁿ.

Correspondingly, "X>>1" pushes everything into lower-valued places, and drops the lowest digit. This means it's equivalent to division: "(X>>1) == (X/2)". In general, right-shifting by n bits is a fast way to divide by 2ⁿ (and ignore the remainder).

You might think right shifting a negative number would bring in zeros, hence flipping it into a positive number, but in C/C++/C# the ">>" operator actually does the correct thing--it brings in zeros for unsigned values, and brings in the sign bit for signed values. This means "x>>1" will turn +10 (1010 binary) into 5 (101 binary), but -10 (...1111110110) into -5 (...1111111011), just like it should. Java doesn't have an "unsigned" data type, but it does have an arithmetic right-shift called ">>>" that brings in zeros; ">>" assumes signed by default.

Finally, "X&0x1" drops all digits higher than the 1's place, so the result is either 0 or 1 corresponding to whether X was even or odd; that is, it's the modulo-2 operation (remainder after dividing by 2), so "(X&0x1)==(X%2)". Similarly, "X&0x3" gives a result from 0-3, corresponding to the version of X where we've dropped corresponding the higher binary digits, so "(X&0x3)==X%4". So masking is a fast way to do modulus operation.

All three of these can be used to speed up arithmetic: multiplying is pretty fast on modern machines, but it's not (quite) as fast as bit shifting. Division and modulus operations are really quite slow on most machines, so replacing them by bitshifts can often give a 20x speedup! Keep in mind, though, that the compiler also knows about these tricks--so if you write "X/4" somewhere, the compiler will almost always use the bit shift instead of the divide. The only place the compiler won't help you is when it doesn't know what you're dividing by--so if you write "X/B", even if B always turns out to be a power of two, the compiler will use the slow divide instruction instead of a fast bit shift. This means you may have to keep track of the corresponding bit shift (log-base-2 of B) or bit mask (for B a power of two, it's just B-1) manually, which is a pain, but sometimes speed hurts!

Once place where bit-style arithmetic operations really shine is with packed fields. Let's say you've got two packed ARGB colors A and B (i.e., four 8-bit fields) that you want to average--blend together at 50% intensity. The usual way to do this would be to extract the alpha, red, green, and blue fields (using masking and bit shifts), blend them by adding them together and dividing by two, and reassemble them using more bit shifts and OR operations--a total of like 4*(2+2+2)=24 operations, including four divides. But it's way faster to do this:

	int blend=((A>>1)&0x7f7f7f7f)+((B>>1)&0x7f7f7f7f);

That is, we divide all the fields of both inputs by 2 using a bit shift, mask off space for the (overflow or carry) in the high bit, and add. This gives you a four-color blend operation for the cost of 5 cheap single-clock bit operations! Michael Herf has a great page on a similar trick for weighted blending. This use of bitwise operations is often called "SIMD within a register (SWAR)" or "word-SIMD"; see Sean Anderson's "Bit Twiddling Hacks" for a variety of amazing examples.

Another use of bit-packed fields is when processing DNA data. The genome uses just 4 digits (ACGT, for the acids Adenine, Cytosine, Guanine, and Thymine), and so can be represented in as few as 2 bits per nucleotide (genetic digit). Former UAF CS undergraduate James Long, now up the hill at ARSC, developed a very fast sofware implementation of the Smith-Waterman string (or gene) matching algorithm called CBL that uses this SIMD-within-a-register approach.

Arithmetic In Binary

We can do arithmetic in binary or hex by hand just like we do in decimal. To add, line up the digits, add corresponding digits, and if the per-digit sum is greater than the base, carry to the next digit. Easy, right? To subtract, do the exact same thing, but "borrow" from the next digit if the per-digit difference is less than 0.

For example, in binary 01+01=10 because the first digit overflows, and the extra "1" is carried to the next digit. Similarly, 1111+1=10000 because all the digits overflow in sequence. In general, adding a "1" will cause carries to ripple up through ones, flipping them to zeros, until it finally reaches a zero, which it will flip to a one.

Addition in hex is exactly the same--it's a bit tricker to add the larger digits involved, but carries work exactly the same. So 0x8+0x8=0x10, and 0xffff+0x1=0x10000.

Subtraction in binary seems really bizarre until you remember than 10-1=1 in binary--that is, "1" is the one-less-than-zero digit in binary; just like "9" is the corresponding one-below-zero digit in decimal. So when you have to borrow, you just flip the zeros to ones until you hit a one.

Subtraction actually shows you how to represent negative numbers in binary. Consider -1==0-1: you just keep on flipping zeros to ones forever, "borrowing" against the future that never comes (just like a credit card!). So -1 is represented (in principle) by an infinite number of ones, just like +1 is represented (in principle) by an infinite number of zeros followed by a one. In practice, we only store a finite number (usually 32 or 64) of bits, so on a 32-bit machine we define 32 ones as -1. The highest bit, then, can be thought of as a "sign bit"--negative numbers have that bit set, positive numbers have that bit clear. Suprisingly, it make sense to think of the sign bit in digit n as having value -2ⁿ, instead of value 2ⁿ for unsigned numbers. What's weirder is that addition and subtraction are exactly the same for signed or unsigned numbers--try it! (All other operations are different, though: comparison, multiplication, division, etc.)

Signed versus unsigned numbers are clearer if you draw them out for a 3-bit machine:

Bit Pattern	Unsigned Value	Signed Value
000	0	0
001	1	1
010	2	2
011	3	3
100	4	-4
101	5	-3
110	6	-2
111	7	-1

Note that everything but Java supports "signed" as well as "unsigned" integers explicitly. In C/C++/C#, typecasting to an unsigned value does nothing to the bits, and is hence a zero-clock operation. One way to speed up a "zero to n" bounds test on a signed value is to turn it into an unsigned value and just compare against n--that is, "if ((x>=0)&&(x<n)) ..." is the same as "if (((unsigned int)x)<n) ..." do exactly the same thing, because negative signed x's will turn into really huge unsigned x's!

In hex, -1 (in binary, all ones) is written in hex as 0xFFffFFff (on a 32-bit machine).

Storage Sizes

Eight bits make a "byte" (note: it's pronounced exactly like "bite", but always spelled with a 'y'), although in some rare networking manuals (and in French) the same eight bits would be called an "octet" (hard drive sizes are in "Go", Giga-octets, when sold in French). There are some rarely-used, quasi-joke measurements like a four-bit "nybble", but these are quite rare, and basically just jokes. In DOS and Windows programming, 16 bits is a "WORD", 32 bits is a "DWORD" (double word), and 64 bits is a "QWORD"; but in other contexts "word" means the machine's natural binary processing size, which ranges from 32 to 64 bits nowadays. "word" should be considered ambiguous. Giving an actual bit count is the best approach ("The file begins with a 32-bit binary integer describing...").

Object	Overflow Value	Bits	Hex Digits (4 bits each)	Bytes (8 bits each)
Bit	2	1	less than 1	less than 1
Byte, char	256	8	2	1
"short" (or Windows WORD)	65536	16	4	2
"int" (Windows DWORD)	>4 billion	32	8	4
"long" (or sometimes "long long")	>16 quadrillion	64	16	8