Scribd
Upload
0 views

Error Detection and Correction

The document discusses error detection and correction techniques used in the data-link layer to ensure accurate data transmission. It outlines types of errors, including single bit errors and burst errors, and describes various detection methods such as parity checks, checksums, and cyclic redundancy checks (CRC). Additionally, it covers error correction methods, including backward and forward error correction, and introduces error-correcting codes like Hamming codes and Low-Density Parity Check codes.

Uploaded by

anjacboy
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0 views

Error Detection and Correction

The document discusses error detection and correction techniques used in the data-link layer to ensure accurate data transmission. It outlines types of errors, including single bit errors and burst errors, and describes various detection methods such as parity checks, checksums, and cyclic redundancy checks (CRC). Additionally, it covers error correction methods, including backward and forward error correction, and introduces error-correcting codes like Hamming codes and Low-Density Parity Check codes.

Uploaded by

anjacboy
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 6

Error Detection and Correction

• Error correction and error detection techniques are work on the data-link layer.
• The data link layer ensures the frames are sent from the sender to the receiver with
accuracy.
• The data can be corrupted during transmission.
• Some application requires that the errors being detected or corrected

Error

• An error is a situation when the data send by the sender and receive by the receiver,
but that data doesn't match the sender data.
• For example, the sender sends the 010101 data, and the receiver receives the 110101.

Types of errors:

• Whenever the bits flow from one point to another, some unpredictable changes occur
because of an interference.
• The interference can change the shape of the signal. There are two types of errors.
• Single bit error
• Burst error

Single bit Error

In the single-bit error, only one bit is corrupted in the frame.

Example: (0 to 1) or (1 to 0).

For example, the sender sends the data (01010100) in the frame, and the receiver receives the
data (11010100) in the frame.

Example

0 1 0
1 0 1 0 0 1 1 0 1 0 1 0 0
Data Sent Data Received
Multi bit Error

In the received frame, more than one bits are corrupted.

0 1 0 1 0 1 0 0 1 1 0 1 0 1 1 0
Data Sent Data Received
Burst error:

In the burst error, one or more than one bits is corrupted in the frame.

For example, the sender sends the data (01010100) in the frame, and the receiver receives the
data (11010100) in the frame.

0 1 0 1 0 1 0 0 1 1 0 1 1 1 1 1
Data Sent Data Received
Error Detection Techniques

There are three main techniques for detecting errors in frames: Parity Check, Checksum and
Cyclic Redundancy Check (CRC).

• Simple Parity check


• Two-dimensional Parity check
• Checksum
• Cyclic redundancy check

Parity Check

The parity check is done by adding an extra bit, called parity bit to the data to make a number
of 1s either even in case of even parity or odd in case of odd parity.

even parity:

• If a number of 1s is even then parity bit value is 0.


• If the number of 1s is odd then parity bit value is 1.

odd parity:

• If a number of 1s is odd then parity bit value is 0.


• If a number of 1s is even then parity bit value is 1.
• On receiving a frame, the receiver counts the number of 1s in it. In case of even parity
check, if the count of 1s is even, the frame is accepted, otherwise, it is rejected. A
similar rule is adopted for odd parity check.
• The parity check is suitable for single bit error detection only.

Simple Parity check


Blocks of data from the source are subjected to a check bit or parity bit generator form,
where a parity of :
• 1 is added to the block if it contains odd number of 1’s, and
• 0 is added if it contains even number of 1’s
This scheme makes the total number of 1’s even, that is why it is called even parity
checking.

2. Two-dimensional Parity check

• Parity check bits are calculated for each row, which is equivalent to a simple parity
check bit.
• Parity check bits are also calculated for all columns, then both are sent along with
the data.
• At the receiving end these are compared with the parity bits calculated on the
received data.
3. Checksum
In this error detection scheme, the following procedure is applied
• Data is divided into fixed sized frames or segments.
• The sender adds the segments using 1’s complement arithmetic to get the sum. It then
complements the sum to get the checksum and sends it along with the data frames.
• The receiver adds the incoming segments along with the checksum using 1’s
complement arithmetic to get the sum and then complements it.
• If the result is zero, the received frames are accepted; otherwise, they are discarded.

4. Cyclic redundancy Check (CRC)

• CRC is based on binary division.


• In CRC, a sequence of redundant bits, called cyclic redundancy check bits, are
appended to the end of data unit so that the resulting data unit becomes exactly divisible
by a second, predetermined binary number.
• At the destination, the incoming data unit is divided by the same number.
• If at this step there is no remainder, the data unit is assumed to be correct and is
therefore accepted.
• A remainder indicates that the data unit has been damaged in transit and therefore must
be rejected.
Error Correction
In the digital world, error correction can be done in two ways:
• Backward Error Correction : When the receiver detects an error in the data
received, it requests back the sender to retransmit the data unit.
• Forward Error Correction: When the receiver detects some error in the data
received, it executes error-correcting code, which helps it to auto-recover and to
correct some kinds of errors.

Error-Correcting Codes

There four different error-correcting codes:


1. Hamming codes.
2. Binary convolutional codes.
3. Reed-Solomon codes.
4. Low-Density Parity Check codes

• Hamming code is a set of error-correction codes that can be used to detect and
correct the errors that can occur when the data is moved or stored from the sender to
the receiver.
• It is a technique developed by R.W. Hamming for error correction.
• Hamming code is a liner code that is useful for error detection up to two immediate
bit errors. It is capable of single-bit errors.
• In Hamming code, the source encodes the message by adding redundant bits in the
message. These redundant bits are mostly inserted and generated at certain positions
in the message to accomplish error detection and correction process.
Error detection and correction by using hamming code is as follows

• To each group of m information bits k parity bits are added to form (m+k) bit code
• Location of each of the (m+k) digits is assigned a decimal value.
• The k parity bits are placed in positions 1, 2, …, 2k-1 positions.–K parity checks are
performed on selected digits of each codeword.
• At the receiving end the parity bits are recalculated. The decimal value of the k
parity bits provides the bit-position in error, if any.
• Use of Hamming code for error correction for a 4-bit data

Low-Density Parity Check codes

• This examples illustrates an (12, 3, 4) LDPC matrix, i.e. n = 12, j = 3 and k = 4. This
implies that each equation operates on 4 code symbols and each code symbol
appears in 3 equations.
• Unlike parity check matrix of the Hamming code, this code does not have any
diagonal 1s in parity bits.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy