Johnson's code is a binary number system in which two adjacent values differ only in one binary digit.
Johnson Code Formation Principles
Johnson's 4-bit code0000 0001 0011 0111 1111 1110 1100 1000 |
- The Johnson code is a code in excess, that is, for the number of bits more than 2 in the Johnson code, a larger number of bits is required to encode a certain number of states than in a binary arithmetic code.
- The Johnson code is an anti-jam code. This means that each subsequent combination differs from the previous value of only one category.
- In the circuitry of counters, this property eliminates the simultaneous switching of many elements characteristic of binary counters for some transitions. The simultaneous switching of many elements creates such current pulses in the power circuits of the circuits that can cause malfunctions in the circuit.
- Johnson code is a cyclic code. That is, the last combination differs from the first by the value of only one bit.
- The Johnson code is generated from the right to the left, and the introduction of each new discharge is carried out until there are units in all the digits. After that, in the same order (from the right to the left), zeros are filled until only one remains in the high order.
See also
- Gray Code
- Hamming Code