Binary Number System

The binary number system is the fundamental language of all digital systems including computers, microcontrollers, and logic circuits. Every piece of data processed by a digital circuit is ultimately represented as a sequence of 1s and 0s. Understanding binary place values and conversion methods is essential before studying any other topic in digital electronics.

Core Concept Explanation

The binary system uses only two symbols, 0 and 1, because digital circuits are built from transistors that operate in two stable states: OFF (representing 0) and ON (representing 1). Any attempt to use more than two states would make circuits susceptible to noise, since small voltage fluctuations could cause a misread. Binary avoids this problem entirely by using two clearly separated voltage levels, typically 0V for logic 0 and 3.3V or 5V for logic 1.

Each digit in a binary number is called a bit (binary digit). A group of 4 bits is called a nibble, and a group of 8 bits is a byte. The rightmost bit is the Least Significant Bit (LSB) with weight 2^0 = 1. The leftmost bit is the Most Significant Bit (MSB) with weight 2^(n-1) for an n-bit number. This positional weighting is exactly analogous to the decimal system but with powers of 2 instead of powers of 10.

The total number of distinct values representable by n bits is 2^n. A 4-bit number can represent 2^4 = 16 values (0 to 15). An 8-bit number represents 2^8 = 256 values (0 to 255). A 16-bit number covers 0 to 65535. This exponential relationship between bit width and representable range is fundamental to understanding data types in computer architecture.

Mathematical Expression

Any binary number (b_n b_{n-1} ... b_1 b_0) in base 2 is converted to its decimal equivalent using the positional notation formula:

Decimal Value = b_n x 2^n + b_(n-1) x 2^(n-1) + ... + b_1 x 2^1 + b_0 x 2^0

For conversion from decimal to binary, the repeated division method is used. The decimal number is divided by 2 repeatedly and the remainders recorded. Reading these remainders from bottom to top gives the binary equivalent. The division continues until the quotient reaches 0.

Practical Understanding

Every operation inside a CPU, memory access, data transfer over USB, and even Wi-Fi frame encoding ultimately relies on binary representation. When you store a character like 'A' in memory, it is stored as 01000001 (ASCII code 65 in binary). When your processor adds two numbers, it performs binary addition using digital adder circuits built from logic gates.

Binary arithmetic follows simple rules. In binary addition, 0+0=0, 0+1=1, 1+0=1, and 1+1=10 (sum 0, carry 1). The carry propagates exactly as in decimal addition. This carry mechanism is what half-adder and full-adder circuits implement in hardware. Understanding binary addition is a prerequisite for studying adder circuits, subtractors, and ALU design.

Given:
Convert decimal 109 to binary and verify by back-converting.

Why this formula applies:
Decimal to binary uses repeated division by 2. Binary to decimal uses weighted sum of bit positions.

Formula:
Decimal to Binary: Divide by 2, record remainders, read upward.
Binary to Decimal: Sum of (bit x 2^position)

Substitution (Decimal to Binary):
109 / 2 = 54  R 1  (bit 0, LSB)
54  / 2 = 27  R 0  (bit 1)
27  / 2 = 13  R 1  (bit 2)
13  / 2 = 6   R 1  (bit 3)
6   / 2 = 3   R 0  (bit 4)
3   / 2 = 1   R 1  (bit 5)
1   / 2 = 0   R 1  (bit 6, MSB)

Calculation (Binary to Decimal verification):
(1101101)2 = 1x64 + 1x32 + 0x16 + 1x8 + 1x4 + 0x2 + 1x1
= 64 + 32 + 0 + 8 + 4 + 0 + 1

Final Answer:
(109)10 = (1101101)2    Verification: 64+32+8+4+1 = 109 (correct)

Exam Tip: For GATE, memorize powers of 2 up to 2^16 = 65536. A fast trick: if the MSB alone equals the decimal number (like 1000 = 8), it is a power of 2. Also remember that n bits represent 0 to 2^n - 1, not 0 to 2^n.

Quick Revision

• Binary uses base 2 with digits 0 and 1 only. Each position has weight 2^n where n is the position index from right starting at 0.
• Binary to Decimal: Multiply each bit by 2^position and sum all products.
• Decimal to Binary: Repeatedly divide by 2 and read remainders from bottom to top (last remainder is MSB).
• n bits represent 2^n distinct values: 0 to (2^n - 1).
• MSB = leftmost bit, highest weight. LSB = rightmost bit, weight = 1.
• Common trap: Do not read remainders top-to-bottom in the division method. The first remainder is the LSB, not the MSB.
• Key powers of 2: 2^4=16, 2^8=256, 2^10=1024, 2^16=65536, 2^32 approx 4.3 billion.