Scribd
Upload
18 views

Error Correction Methodshamming Code

There are two main methods for error correction: retransmission and forward error correction. Retransmission detects errors and resends data, while forward error correction adds redundant bits to allow detection and correction without retransmission. Hamming codes are a type of forward error correction that add redundant bits to detect and correct single-bit errors. Hamming first developed error-correcting codes in the 1940s to improve computer reliability. Hamming codes remain widely used today for their effectiveness in correcting random errors.

Uploaded by

22MMC024 LOGESH K
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
18 views

Error Correction Methodshamming Code

There are two main methods for error correction: retransmission and forward error correction. Retransmission detects errors and resends data, while forward error correction adds redundant bits to allow detection and correction without retransmission. Hamming codes are a type of forward error correction that add redundant bits to detect and correct single-bit errors. Hamming first developed error-correcting codes in the 1940s to improve computer reliability. Hamming codes remain widely used today for their effectiveness in correcting random errors.

Uploaded by

22MMC024 LOGESH K
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 18

ERROR CORRECTION

METHODS
TWO METHODS

Retransmission after detecting error


(Single Bit Error correction)
Forward error correction (FEC)
(Hamming code Technique)
SINGLE-BIT ERROR CORRECTION

To correct an error, the receiver reverses the value


of the altered bit. To do so, it must know which bit
is in error.
Number of redundancy bits needed
 Let data bits = m

 Redundancy bits = r

Total message sent = m+r


The value of r must satisfy the following relation:
2r ≥ m+r+1
FORWARD ERROR CORRECTION

 Consider only a single-bit error in k bits of data


k possibilities for an error
 One possibility for no error
 #possibilities = k + 1
 Add r redundant bits to distinguish these
possibilities; we need
2r  k+1
 Butthe r bits are also transmitted along with
data; hence
2r  k+r+1

4
HISTORY
 In the late 1940’s Richard Hamming recognized that the
further evolution of computers required greater
reliability, in particular the ability to not only detect
errors, but correct them. His search for error-correcting
codes led to the Hamming Codes, perfect 1-error
correcting codes, and the extended Hamming Codes, 1-
error correcting and 2-error detecting codes.
HAMMING CODES
1. One of the most effective codes for error-recovery
2. Used in situations where random errors are likely to occur
3. Error detection and correction increases in proportion to the
number of parity bits (error-checking bits) added to the
end of the information bits

code word = information bits + parity bits


Hamming distance: the number of bit positions in which
two code words differ.
10001001
10110001
***
Minimum Hamming distance or D(min) : determines its
error detecting and correcting capability.
USES
 Hamming Codes are still widely used in
computing, telecommunication, and other
applications.
 Hamming Codes also applied in

Data compression
Some solutions to the popular puzzle The
Hat Game
Error Correction
HAMMING CODE:
NUMBER OF REDUNDANT BITS
Number of Number of Total
data bits redundancy bits bits
k r k+r
1 2 3
2 3 5
3 3 6
4 3 7
5 4 9
6 4 10
7 4 11
9
Hamming Code
Hamming Code
Hamming Code
Example of Hamming Code
Single-bit error
Error
Detection
THE HAT GAME
 A group of n players enter a room whereupon they each
receive a hat. Each player can see everyone else’s hat
but not his own.
 The players must each simultaneously guess a hat color,
or pass.
 The group loses if any player guesses the wrong hat
color or if every player passes.
 Players are not necessarily anonymous, they can be
numbered.
THE HAT GAME
 Assignment of hats is assumed to be random.
 The players can meet beforehand to devise a strategy.

 The goal is to devise the strategy that gives the highest


probability of winning.

You might also like