Fixed-point arithmetic represents values as integers on a fixed grid. For a chosen bit width, allocating more bits to range leaves fewer for precision. section 2.6 section 2.1
Figure 2.1 The Q3.4 fixed-point format divides 8 bits into a sign bit, 3 integer bits, and 4 fractional bits. Here, the bit pattern 0 001 1000 encodes +1.5 — the integer bits 001 contribute 1, and the leading fractional bit 1000 contributes 2-¹ = 0.5.

The Q3.4 diagram shows how an 8-bit pattern encodes a value and divides bits between integer and fractional parts. section 2.1
A fixed-point implementation must account for:
- Quantization maps values to grid points; rounding error is bounded by half a step, while clipping values outside the grid can cause larger distortion. section 2.6
- Multiplication increases the number of fractional bits, so the product must be shifted back; rounding before the shift avoids the systematic downward error of truncation. section 2.1
- Overflow can wrap in two's-complement arithmetic or be constrained by saturation; range limits apply to both inputs and accumulated results. section 2.6
- For quantized tensors, scale and zero-point map integer storage to real values; symmetric weights and asymmetric activations pair different grid choices with their distributions. section 2.6
Q3.4 arithmetic
In Q3.4, 1.5 and 0.5 are stored as raw integers 24 and 8. Their product is shifted back to produce 0.75; storing 10.0 or adding 5.0 to 5.0 saturates at 7.9375. section 2.1
