iPedia Free Information Center

Information about Parity Bit

7 bits of databyte with parity bit
evenodd
00000000000000010000000
10100011101000101010001
11010010110100111101001
11111111111111101111111
A parity bit is a binary digit that indicates whether the number of bits with value of one in a given set of bits is even or odd. Parity bits are used as the simplest error detecting code.

There are two types 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 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 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.

Additionally, parity bits can be referred to as mark parity, where the parity bit is always 1, and space parity, where the bit is always 0.

Error detection

If an odd number of bits (including the parity bit) are changed in transmission of a set of bits then parity bit will be incorrect and will thus indicate that an error in transition has occurred. Therefore, parity bit is an error detecting code, but is not an error correcting code as there is no way to determine which particular bit is corrupted. The data must be discarded entirely, and re-transmitted from scratch. On a noisy transmission medium a successful transmission could take a long time, or even never occur. Parity does have the advantage, however, that it is about the best possible code that uses only a single bit of space and it requires only a number of XOR gates to generate. See Hamming code for an example of an error-correcting code.

For example, our parity bit can be computed as follows assuming we are sending a simple 4-bit value 1001 (the parity bit is the leftmost bit of the sent/received values):

A computes even parity: 1^0^0^1 = 0 A sends: 01001 B receives: 01001 B validates even parity: 1^0^0^1 = 0

A computes odd parity: ~(1^0^0^1) = 1 A sends: 11001 B receives: 11001 B validates odd parity: ~(1^0^0^1) = 1

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 assuming even parity when sending 4-bit value 0010 (the parity bit is the leftmost bit of the sent/received values):

A computes even parity: 0^0^1^0 = 1 A sends: 10010
  • ** TRANSMISSION ERROR ***
B receives: 11010 B validates even parity: 1^0^1^0 = 0

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

A computes even parity: 0^0^1^0 = 1 A sends: 10010
  • ** TRANSMISSION ERROR ***
B receives: 00010 B validates even parity: 0^0^1^0 = 1

Once again, B's calculated parity value (1) does not match the parity bit (0) in its received value, 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 (even parity, value 0010) with an even number of corrupted bits:

A computes even parity: 0^0^1^0 = 1 A sends: 10010
  • ** TRANSMISSION ERROR ***
B receives: 11011 B validates even parity: 1^0^1^1 = 1

B's calculated parity value (1) matches the parity bit (1) in its received value, 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 bus uses 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 bits, an even parity bit, and one or two stop bits. This format neatly accommodates all the 7-bit ASCII characters in a convenient 8-bit byte. Other formats are possible; 8 bits of data plus a parity bit can convey all 8-bit byte values.

In serial communication contexts, parity is usually generated and checked by interface hardware (e.g., a UART) and, on reception, the result made available to the CPU (and so to, for instance, the operating system) via a status bit in a register in the interface hardware. Recovery from the error is usually done by retransmitting the data, the details of which are usually handled by software (e.g., the operating system I/O routines).

Parity block

A parity block is used by certain RAID levels. Redundancy is achieved by the use of parity blocks. If a single drive in the array fails, data blocks and a parity block from the working drives can be combined to reconstruct the missing data.

Given the diagram below, where each column is a disk, assume A1 = 00000111, A2 = 00000101, and A3 = 0000000. Ap, generated by XORing A1, A2, and A3, will then equal 00000010. If the second drive fails, A2 will no longer be accessible, but can be reconstructed by XORing A1, A3, and Ap:

A1 XOR A3 XOR Ap = 00000101

RAID array A1 A2 A3 Ap B1 B2 Bp B3 C1 Cp C2 C3 Dp D1 D2 D3

Note: Data blocks are in the format A#, parity blocks Ap.

External links

BIT is an acronym for:
  • Bannari amman Institute of Technology
  • Bangalore Institute of Technology
  • Beijing Institute of Technology
  • Benzisothiazolinone
  • Bilateral Investment Treaty
  • Bhilai Institute of Technology - Durg

..... Click the link for more information.
This article is about the number one. For the year AD 1, see 1. For other uses, see 1 (disambiguation).

0 1 2 3 4 5 6 7 8 9 →

..... Click the link for more information.
In mathematics, the parity of an object refers to whether it is even or odd.

The formal definition of an odd number is an integer of the form n=2k +1, where k is an integer. The definition of an even number is n=2k where k is an integer.
..... Click the link for more information.
In mathematics, the parity of an object refers to whether it is even or odd.

The formal definition of an odd number is an integer of the form n=2k +1, where k is an integer. The definition of an even number is n=2k where k is an integer.
..... Click the link for more information.
In mathematics, computer science, telecommunication, and information theory, error detection and correction has great practical importance in maintaining data (information) integrity across noisy channels and less-than-reliable storage media.
..... Click the link for more information.
A cyclic redundancy check (CRC) is a type of function that takes as input a data stream of any length and produces as output a value of a certain fixed size. The term CRC is often used to denote either the function or the function's output.
..... Click the link for more information.
In mathematics, a polynomial is an expression that is constructed from one or more variables and constants, using only the operations of addition, subtraction, multiplication, and constant positive whole number exponents. is a polynomial.
..... Click the link for more information.
In telecommunications, transmission is the forwarding of signal traffic over distances that are too great to be simply connected by a twisted pair wires. Techniques available now may be microwave link, satellite link, coaxial cable or fibre optic cable.
..... Click the link for more information.
XOR gate is a digital logic gate that implements exclusive disjunction - it behaves according to the truth table to the right. A HIGH output (1) results if one, and only one, of the inputs to the gate is HIGH (1).
..... Click the link for more information.
In telecommunication, a Hamming code is a linear error-correcting code named after its inventor, Richard Hamming. Hamming codes can detect and correct single-bit errors. In other words, the Hamming distance between the transmitted and received code-words must be zero or one for
..... Click the link for more information.
In mathematics, computer science, telecommunication, and information theory, error detection and correction has great practical importance in maintaining data (information) integrity across noisy channels and less-than-reliable storage media.
..... Click the link for more information.
Computer hardware is the physical part of a computer, including the digital circuitry, as distinguished from the computer software that executes within the hardware. The hardware of a computer is infrequently changed, in comparison with software and data, which are "soft" in the
..... Click the link for more information.
SCSI (Small Computer System Interface) is a set of standards for physically connecting and transferring data between computers and peripheral devices. The SCSI standards define commands, protocols, and electrical and optical interfaces.
..... Click the link for more information.
Microprocessor

Die of an Intel 80486DX2 microprocessor (actual size: 12×6.75 mm) in its packaging
Date Invented: Late 1960s/Early 1970s (see article for explanation)

Connects to:
..... Click the link for more information.
cache (IPA:/kæʃ/, like "catch" [1]) is a collection of data duplicating original values stored elsewhere or computed earlier, where the original data is expensive to fetch (due to longer access time) or to
..... Click the link for more information.
In telecommunications and computer science, serial communications is the process of sending data one bit at one time, sequentially, over a communications channel or computer bus. This is in contrast to parallel communications, where all the bits of each symbol are sent together.
..... Click the link for more information.
Data transmission is the conveyance of any kind of information from one space to another. Historically this could be done by courier, a chain of bonfires or semaphores, and later by Morse code over copper wires.
..... Click the link for more information.
Asynchronous serial communication describes an asynchronous transmission protocol in which a start signal is sent prior to each byte, character or code word and a stop signal is sent after each code word.
..... Click the link for more information.
American Standard Code for Information Interchange (ASCII), generally pronounced ask-ee IPA: /ˈæski/ ( [1] ), is a character encoding based on the English alphabet.
..... Click the link for more information.
universal asynchronous receiver/transmitter (usually abbreviated UART and pronounced IPA: /ˈjuːɑrt/
..... Click the link for more information.
An operating system (OS) is the software that manages the sharing of the resources of a computer. An operating system processes system data and user input, and responds by allocating and managing tasks and internal system resources as a service to users and programs of the
..... Click the link for more information.
In computer architecture, a processor register is a small amount of storage available on the CPU whose contents can be accessed more quickly than storage available elsewhere.
..... Click the link for more information.
Raid or RAID may refer to:
  • Redundant Array of Independent/Inexpensive Disks, or RAID, a system of multiple hard drives for sharing or replicating data.

..... Click the link for more information.
Raid or RAID may refer to:
  • Redundant Array of Independent/Inexpensive Disks, or RAID, a system of multiple hard drives for sharing or replicating data.

..... Click the link for more information.


This article is copied from an article on Wikipedia.org - the free encyclopedia created and edited by online user community. The text was not checked or edited by anyone on our staff. Although the vast majority of the wikipedia encyclopedia articles provide accurate and timely information please do not assume the accuracy of any particular article. This article is distributed under the terms of GNU Free Documentation License.
Herod_Archelaus


page counter