Offset binary, also referred to as excess-K, excess-N, excess-e, excess code or biased representation, is a method for signed number representation where a signed number n is represented by the bit pattern corresponding to the unsigned number n+K, K being the biasing value or offset. There is no standard for offset binary, but most often the K for an n-bit binary word is K = 2n−1 (for example, the offset for a four-digit binary number would be 23=8). This has the consequence that the minimal negative value is represented by all-zeros, the "zero" value is represented by a 1 in the most significant bit and zero in all other bits, and the maximal positive value is represented by all-ones (conveniently, this is the same as using two's complement but with the most significant bit inverted). It also has the consequence that in a logical comparison operation, one gets the same result as with a true form numerical comparison operation, whereas, in two's complement notation a logical comparison will agree with true form numerical comparison operation if and only if the numbers being compared have the same sign. Otherwise the sense of the comparison will be inverted, with all negative values being taken as being larger than all positive values.
The 5-bit Baudot code used in early synchronous multiplexing telegraphs can be seen as an offset-1 (excess-1) reflected binary (Gray) code.
One historically prominent example of offset-64 (excess-64) notation was in the floating point (exponential) notation in the IBM System/360 and System/370 generations of computers. The "characteristic" (exponent) took the form of a seven-bit excess-64 number (The high-order bit of the same byte contained the sign of the significand).
The 8-bit exponent in Microsoft Binary Format, a floating point format used in various programming languages (in particular BASIC) in the 1970s and 1980s, was encoded using an offset-129 notation (excess-129).
The IEEE Standard for Floating-Point Arithmetic (IEEE 754) uses offset notation for the exponent part in each of its various formats of precision. Unusually however, instead of using "excess 2n−1" it uses "excess 2n−1 − 1" (i.e. excess-15, excess-127, excess-1023, excess-16383) which means that inverting the leading (high-order) bit of the exponent will not convert the exponent to correct two's complement notation.
Offset binary is often used in digital signal processing (DSP). Most analog to digital (A/D) and digital to analog (D/A) chips are unipolar, which means that they cannot handle bipolar signals (signals with both positive and negative values). A simple solution to this is to bias the analog signals with a DC offset equal to half of the A/D and D/A converter's range. The resulting digital data then ends up being in offset binary format.
Most standard computer CPU chips cannot handle the offset binary format directly. CPU chips typically can only handle signed and unsigned integers, and floating point value formats. Offset binary values can be handled in several ways by these CPU chips. The data may just be treated as unsigned integers, requiring the programmer to deal with the zero offset in software. The data may also be converted to signed integer format (which the CPU can handle natively) by simply subtracting the zero offset. As a consequence of the most common offset for an n-bit word being 2n−1, which implies that the first bit is inverted relative to two's complement, there is no need for a separate subtraction step, but one simply can invert the first bit. This sometimes is a useful simplification in hardware, and can be convenient in software as well.
Table of offset binary for four bits, with two's complement for comparison:
| Decimal | Offset binary, K = 8 | Two's complement | |
|---|---|---|---|
| 7 | 1111 | 0111 | |
| 6 | 1110 | 0110 | |
| 5 | 1101 | 0101 | |
| 4 | 1100 | 0100 | |
| 3 | 1011 | 0011 | |
| 2 | 1010 | 0010 | |
| 1 | 1001 | 0001 | |
| 0 | 1000 | 0000 | |
| −1 | 0111 | 1111 | |
| −2 | 0110 | 1110 | |
| −3 | 0101 | 1101 | |
| −4 | 0100 | 1100 | |
| −5 | 0011 | 1011 | |
| −6 | 0010 | 1010 | |
| −7 | 0001 | 1001 | |
| −8 | 0000 | 1000 |
Offset binary may be converted into two's complement by inverting the most significant bit. For example, with 8-bit values, the offset binary value may be XORed with 0x80 in order to convert to two's complement. In specialised hardware it may be simpler to accept the bit as it stands, but to apply its value in inverted significance.
z=
| 1 | |
| q |
| n | |
| \left[\left(\sum | |
| i=1 |
pi x bi\right)-k\right]
| Code | Type | Parameters | Weights | Distance | Checking | Complement | Groups of 5 | Simple addition | |||
|---|---|---|---|---|---|---|---|---|---|---|---|
| Offset, k | Width, n | Factor, q | |||||||||
| 8421 code | n | 0 | 4 | 1 | 8 4 2 1 | 1–4 | No | No | No | No | |
| Nuding code | 3n + 2 | 2 | 5 | 3 | 2–5 | Yes | 9 | Yes | Yes | ||
| Stibitz code | n + 3 | 3 | 4 | 1 | 8 4 | 1–4 | No | 9 | Yes | Yes | |
| Diamond code | 27n + 6 | 6 | 8 | 27 | 3–8 | Yes | 9 | Yes | Yes | ||
| 25n + 15 | 15 | 8 | 25 | 3+ | Yes | Yes | ? | Yes | |||
| 23n + 24 | 24 | 8 | 23 | 3+ | Yes | Yes | ? | Yes | |||
| 19n + 42 | 42 | 8 | 19 | 3–8 | Yes | 9 | Yes | Yes | |||
|
|
|
|
|
|