Precision Number Base Converter

Theoretical Foundations of Positional Numeral Systems & Radix

In discrete mathematics and computer engineering, a positional numeral system represents any real integer using an ordered sequence of numeric glyphs whose values depend upon their position relative to the radix point. The fundamental parameter defining any positional system is its base (or radix, \(b\)), an integer greater than 1 indicating the count of unique symbol digits available:

$$N = \sum_{i=0}^{n-1} d_i \cdot b^i = d_{n-1} b^{n-1} + d_{n-2} b^{n-2} + \dots + d_1 b^1 + d_0 b^0$$

Where \(d_i \in \{0, 1, \dots, b-1\}\) represents the digit at position \(i\).

Four primary bases form the operational architecture of digital electronics and software engineering:

1. Decimal (Base 10): The human standard numbering system utilizing digits \(\{0, 1, 2, 3, 4, 5, 6, 7, 8, 9\}\), likely derived from counting on ten human fingers.
2. Binary (Base 2): The fundamental machine language of all silicon microprocessors, using only two states \(\{0, 1\}\) representing physical transistor conduction (cutoff vs saturation) or memory capacitor charge.
3. Hexadecimal (Base 16): A compact human-readable representation using digits \(\{0\text{--}9\}\) and letters \(\{\text{A}, \text{B}, \text{C}, \text{D}, \text{E}, \text{F}\}\) (representing 10 through 15). Because \(16 = 2^4\), every single hexadecimal character corresponds exactly to a 4-bit binary nibble.
4. Octal (Base 8): Using digits \(\{0, 1, 2, 3, 4, 5, 6, 7\}\). Because \(8 = 2^3\), each octal digit corresponds exactly to 3 binary bits, universally preserved in Linux file permission modes (e.g., chmod 777).

Exact Mathematical Conversion Algorithms

Transforming numbers between arbitrary bases requires two systematic analytical algorithms: positional expansion to evaluate arbitrary bases into decimal, and successive integer division with remainder extraction to convert decimal into any destination radix.

Hexadecimal-Binary Grouping & Two's Complement Encoding

A major advantage of power-of-two number bases is that conversion between binary, octal, and hexadecimal does not require arithmetic division; it is performed by simple bit-grouping inspection:

• Binary to Hexadecimal: Group binary bits into clusters of 4 starting from the right (least significant bit): $$\text{Binary: } \underbrace{1101}_{\text{D}} \quad \underbrace{1011}_{\text{B}} \quad \underbrace{0000}_{0} \quad \underbrace{1111}_{\text{F}} \implies \mathbf{\text{0xDB0F}}$$
• Binary to Octal: Group bits into clusters of 3 starting from the right: $$\text{Binary: } \underbrace{001}_{1} \quad \underbrace{101}_{5} \quad \underbrace{011}_{3} \implies \mathbf{153_8}$$

For signed integer representation, digital microprocessors utilize Two's Complement Arithmetic. In an \(n\)-bit two's complement system:

$$\text{Range: } -2^{n-1} \le X \le 2^{n-1} - 1$$

For standard 8-bit bytes, the range spans \(-128\) to \(+127\). The most significant bit (MSB) acts as the sign flag: if the MSB is 0, the number is positive; if the MSB is 1, the number is negative. To compute the magnitude of a negative number:

$$-X = \sim X + 1$$

For example, \(11111111_2\) represents \(255\) in an unsigned 8-bit integer, but in signed two's complement it represents \(-1\).

Comprehensive 4-Bit Radix Truth Table (0 to 15)

The reference table below illustrates the exact equivalence across decimal, 4-bit binary, octal, hexadecimal, and standard ASCII control values:

Worked Computer Science Case Study: Memory Dump Register Decoding