Parity (telecommunication)

A parity bit is a binary digit that is added to ensure that the number of bits with value of one in a given set of bits is always even or odd. Parity bits are used as the simplest error detecting code.

There are two variants of parity bits: even parity bit and odd parity bit. An even parity bit is set to 1 if the number of ones in a given set of bits is odd (making the total number of ones, including the parity bit, even). An odd parity bit is set to 1 if the number of ones in a given set of bits is even (making the total number of ones, including the parity bit, odd). Even parity is actually a special case of a cyclic redundancy check (CRC), where the 1-bit CRC is generated by the polynomial x+1.

If the parity bit is present but not used, it may be referred to as mark parity, where the parity bit is always 1, and space parity, where the bit is always 0.

Transmission sent using odd parity:

A wants to transmit:          1001
A computes parity bit value:  ~(1^0^0^1) = 1
A adds parity bit and sends:  10011
B receives:                   10011
B computes overall parity:    1^0^0^1^1 = 1
B reports correct transmission after observing expected odd result.

This mechanism enables the detection of single bit errors, because if one bit gets flipped due to line noise, there will be an incorrect number of ones in the received data. In the two examples above, B's calculated parity value matches the parity bit in its received value, indicating there are no single bit errors. Consider the following example with a transmission error in the second bit:

Transmission sent using even parity:

A wants to transmit:          1001
A computes parity bit value:  1^0^0^1 = 0
A adds parity bit and sends:  10010
*** TRANSMISSION ERROR ***
B receives:                   11010
B computes overall parity:    1^1^0^1^0 = 1
B reports incorrect transmission after observing unexpected odd result.

B's calculated parity value (1) does not match the parity bit (0) in its received value, indicating the bit error. Here's the same example but now the parity bit itself gets corrupted:

B receives:                   10011
B computes overall parity:    1^0^0^1^1 = 1
B reports incorrect transmission after observing unexpected odd result.

Once again, B's computes an odd overall parity, indicating the bit error.

There is a limitation to parity schemes. A parity bit is only guaranteed to detect an odd number of bit errors. If an even number of bits have errors, the parity bit records the correct number of ones, even though the data is corrupt. (See also error detection and correction.) Consider the same example as before with an even number of corrupted bits:

A wants to transmit:          1001
A computes even parity value: 1^0^0^1 = 0
A sends:                      10010
*** TRANSMISSION ERROR ***
B receives:                   11011
B computes overall parity:    1^1^0^1^1 = 0
B reports correct transmission though actually incorrect.

B observes even parity, as expected, thereby failing to catch the two bit errors.

Usage

Because of its simplicity, parity is used in many hardware applications where an operation can be repeated in case of difficulty, or where simply detecting the error is helpful. For example, the SCSI and PCI buses use parity to detect transmission errors, and many microprocessor instruction caches include parity protection. Because the I-cache data is just a copy of main memory, it can be thrown away and re-fetched if it is found to be corrupted.

In serial data transmission, a common format is 7 data bit, an even parity bit, and one or two stop bits. This format neatly accommodates all the 7-bit ASCII.

External links

• Quick way to get the even parity of an integer
• Different methods of generating the parity bit, among other bit operations