Two's complement lets hardware represent signed integers in binary. The most significant bit contributes a negative place value; for an 8-bit integer, it contributes −128, while the remaining bits contribute +64 through +1. section 2.1
Decoding 1111 1111
For an 8-bit signed integer, add the bit values: −128 + 64 + 32 + 16 + 8 + 4 + 2 + 1 = −1. In Q3.4 format, the scale is 1/16, so this pattern represents −1/16, or −0.0625. section 2.1
Figure 2.2 The 8-bit signed integer ring. The 256 possible bit patterns wrap around a circle, with 0 at the top and −1 (1111 1111) one step below it. Moving clockwise increments the integer; moving counterclockwise decrements it.

The 8-bit ring visualizes wraparound: decrementing zero produces 1111 1111, the representation of −1. section 2.1





