Error Detection Methods

Dr. S.Meenatchi, SITE, VIT.

Error Detection Methods
• When sender transmits data to the receiver, the data might get scrambled by noise
or data might get corrupted during the transmission.
• Error detection is a technique that is used to check if any error occurred in the data
during the transmission.

Dr. S.Meenatchi, SITE, VIT.

1. Single Parity Check

Dr. S.Meenatchi, SITE, VIT.

1. Single Parity Check
• One extra bit called as parity bit is sent along with the original data bits.
• Parity bit helps to check if any error occurred in the data during the transmission.

Dr. S.Meenatchi, SITE, VIT.

1. Single Parity Check cont..
Step-01:
• At sender side,
• Total number of 1’s in data unit to be transmitted is counted.
• Total number of 1’s in data unit is made even in case of even parity.
• Total number of 1’s in data unit is made odd in case of odd parity.
• This is done by adding an extra bit called as parity bit.
Step-02:
• Newly formed code word (Original data + parity bit) is transmitted to the receiver.

Dr. S.Meenatchi, SITE, VIT.

1. Single Parity Check cont..
Step-03:
• At receiver side,
• Receiver receives the transmitted code word.
• Total number of 1’s in the received code word is counted.
• Then, following cases are possible-
• If total number of 1’s is even and even parity is used, then receiver assumes that
no error occurred.
• If total number of 1’s is even and odd parity is used, then receiver assumes that
error occurred.
• If total number of 1’s is odd and odd parity is used, then receiver assumes that no
error occurred.
• If total number of 1’s is odd and even parity is used, then receiver assumes that
error occurred. Dr. S.Meenatchi, SITE, VIT.
 Parity Check Example
• Consider the data unit to be transmitted is 1001001 and
even parity is used.
At Sender Side-
• Total number of 1’s in the data unit is counted.
• Total number of 1’s in the data unit = 3.
• Clearly, even parity is used and total number of 1’s is odd.
• So, parity bit = 1 is added to the data unit to make total number of 1’s even.
• Then, the code word 10010011 is transmitted to the receiver.
At Receiver Side-
• After receiving the code word, total number of 1’s in the code word is counted.
• Consider receiver receives the correct code word = 10010011.
• Even parity is used and total number of 1’s is even.
• So, receiver assumes that no error occurred in the data during the transmission.
Dr. S.Meenatchi, SITE, VIT.
1. Single Parity Check cont..
• Advantage
• It is guaranteed to detect an odd number of bit errors.
• If odd number of bits flip during transmission, then receiver can detect by
counting the number of 1’s.
• Limitation
• It can not detect an even number of bit .
• If even number of bits flip during transmission, then receiver can not catch the
error.

Dr. S.Meenatchi, SITE, VIT.

2. Cyclic Redundancy
Check(CRC)

Dr. S.Meenatchi, SITE, VIT.

2. Cyclic Redundancy Check(CRC)
• It is an error detection method.
• It is based on binary division.
• CRC Generator
• It is an algebraic polynomial represented as a bit pattern.
• Bit pattern is obtained from the CRC generator using the following rule:
• Power of each term gives the position of the bit and the coefficient gives
the value of the bit.

Dr. S.Meenatchi, SITE, VIT.

Example
• Consider the CRC generator is x7 + x6 + x4 + x3 + x + 1.

• Thus, for the given CRC generator, the corresponding binary pattern is
11011011.

Dr. S.Meenatchi, SITE, VIT.

2. Cyclic Redundancy Check(CRC) cont..
Step-01: Calculation Of CRC At Sender Side-
At sender side,
• A string of n 0’s is appended to the data unit to be transmitted.
• Here, n is one less than the number of bits in CRC generator.
• Binary division is performed of the resultant string with the CRC generator.
• After division, the remainder so obtained is called as CRC.
• It may be noted that CRC also consists of n bits.
Step-02: Appending CRC To Data Unit-
At sender side,
• CRC is obtained after the binary division.
• String of n 0’s appended to the data unit earlier is replaced by the CRC remainder.
Step-03: Transmission To Receiver-
• Newly formed code word (Original data + CRC) is transmitted to the receiver.
Dr. S.Meenatchi, SITE, VIT.
2. Cyclic Redundancy Check(CRC) cont..
Step-04: Checking at Receiver Side-
• At receiver side,
• Transmitted code word is received.
• Received code word is divided with the same CRC generator.
• On division, the remainder so obtained is checked.
• The following two cases are possible-
• Case-01: Remainder = 0
• If the remainder is zero,
• Receiver assumes that no error occurred in the data during the transmission.
• Receiver accepts the data.
• Case-02: Remainder ≠ 0
• If the remainder is non-zero,
• Receiver assumes that some error occurred in the data during the transmission.
Dr. S.Meenatchi, SITE, VIT.
• Receiver rejects the data and asks the sender for retransmission.
PRACTICE PROBLEMS
A bit stream 1101011011 is transmitted using the standard CRC
method. The generator polynomial is x4+x+1. What is the actual
bit string transmitted?
Solution-
• Generator polynomial G(x) = x4 + x + 1 is encoded as
10011.
• Generator polynomial consists of 5 bits.
• So, a string of 4 zeroes is appended to the bit stream to be
transmitted.
• Resulting bit stream is 11010110110000.
• From here, CRC = 1110.
• Now, The code word to be transmitted is obtained by replacing
the last 4 zeroes of 11010110110000 with the CRC.
• Thus, the code word transmitted to the receiver
Dr. S.Meenatchi, SITE, VIT.
= 11010110111110.
PRACTICE PROBLEMS-2
• A bit stream 10011101 is transmitted using the standard CRC
method. The generator polynomial is x3+1.
• What is the actual bit string transmitted?
• Suppose the third bit from the left is inverted during
transmission. How will receiver detect this error?
Solution
• The generator polynomial G(x) = x3 + 1 is encoded as 1001.
• Clearly, the generator polynomial consists of 4 bits.
• So, a string of 3 zeroes is appended to the bit stream to be
transmitted.
• The resulting bit stream is 10011101000.
• Now, the binary division is performed.
• From here, CRC = 100.
• Now, The code word to be transmitted is obtained by replacing
the last 3 zeroes of 10011101000 with the CRC.
• Thus, the code word transmitted to the receiver
Dr. S.Meenatchi, SITE, VIT. = 10011101100.
PRACTICE PROBLEMS-2 cont..
• According to the question, Third bit from the left gets
inverted during transmission.
• So, the bit stream received by the receiver =
10111101100.
• Now, Receiver receives the bit stream = 10111101100.
• Receiver performs the binary division with the same
generator polynomial.
• From here,
• The remainder obtained on division is a non-zero value.
• This indicates to the receiver that an error occurred in the
data during the transmission.
• Therefore, receiver rejects the data and asks the sender
for retransmission.
Dr. S.Meenatchi, SITE, VIT.
3. Checksum

Dr. S.Meenatchi, SITE, VIT.

3. Checksum
• Checksum is an error detection method.
Step-01:
• At sender side,
• If m bit checksum is used, the data unit to be transmitted is divided into
segments of m bits.
• All the m bit segments are added.
• Result of the sum is then complemented using 1’s complement arithmetic.
• Value so obtained is called as checksum.
Step-02:
• Data along with the checksum value is transmitted to the receiver.
Dr. S.Meenatchi, SITE, VIT.
3. Checksum cont..
Step-03:
• At receiver side,
• If m bit checksum is being used, received data unit is divided into segments of m bits.
• All the m bit segments are added along with the checksum value.
• Value so obtained is complemented and the result is checked.
• Then, following two cases are possible-
• Case-01: Result = 0
• If the result is zero,
• Receiver assumes that no error occurred in the data during the transmission.
• Receiver accepts the data.
• Case-02: Result ≠ 0
• If the result is non-zero,
• Receiver assumes that error occurred in the data during the transmission.
Dr. S.Meenatchi, SITE, VIT.
• Receiver discards the data and asks the sender for retransmission.
Example
Consider the data unit to be transmitted is-
10011001111000100010010010000100
Consider 8 bit checksum is used.
Step-01:
• At sender side,
• The given data unit is divided into segments of 8 bits as-

• Now, all the segments are added and the result is obtained as-
• 10011001 + 11100010 + 00100100 + 10000100 = 1000100011
• Since the result consists of 10 bits, so extra 2 bits are wrapped around.
• 00100011 + 10 = 00100101 (8 bits)
• Now, 1’s complement is taken which is 11011010.
• Thus, checksum value = 11011010 Dr. S.Meenatchi, SITE, VIT.
Example cont..
Step-02:
• The data along with the checksum value is transmitted to the receiver.
Step-03:
• At receiver side,
• The received data unit is divided into segments of 8 bits.
• All the segments along with the checksum value are added.
• Sum of all segments + Checksum value = 00100101 + 11011010 = 11111111
• Complemented value = 00000000
• Since the result is 0, receiver assumes no error occurred in the data and therefore
accepts it.
Dr. S.Meenatchi, SITE, VIT.