Scribd
Upload
24 views

Errorcorrection and Detecion Using Thammingcode

Hamming codes can be used for error correction in data transmission. There are two main methods for error correction: retransmission of data when errors are detected, and forward error correction using codes to automatically correct errors. Hamming codes work by adding redundancy bits that are calculated based on the data bits. The positions of the redundancy bits are used to determine the bits being checked so that if an error is detected, its position can be identified. The example demonstrates how redundancy bits are calculated for an input data string and how Hamming codes can be used to detect the position of an error bit.

Uploaded by

shivaram2388
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
24 views

Errorcorrection and Detecion Using Thammingcode

Hamming codes can be used for error correction in data transmission. There are two main methods for error correction: retransmission of data when errors are detected, and forward error correction using codes to automatically correct errors. Hamming codes work by adding redundancy bits that are calculated based on the data bits. The positions of the redundancy bits are used to determine the bits being checked so that if an error is detected, its position can be identified. The example demonstrates how redundancy bits are calculated for an input data string and how Hamming codes can be used to detect the position of an error bit.

Uploaded by

shivaram2388
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 8

Subject data communication and network

Error correction and hamming code

Error correction
Error correction can be handle in two ways. 1)error correction by retransmission: When receiver detect error during transmission it request to sender to retransmit the data.

2)forward error correction: In forward error correction code receiver use error correction code to automatically correct the data. Note: error correction are more sophisticated then error detection.

Hamming code
Hamming code can be applied to data of any length and use the relationship b/w data and redundancy bits. Hamming code can find the error . position of redundancy bits in hamming code
11 10 9 8 7 6 5 4 3 2 1

r8 d

r4 d

r2 r1

r1 will take care of these bits


11 9 7 5 3 1

r8 d

r4 d

r2 r1

r2 will take care of these bits


11 10 7 6 3 2

r8 d
7 6

d
5

d
4

r4 d

r2 r1

r1 will take care of these bits r4


d d d r8 d d d r4 d r2 r1

r8 will take care of these bits


11 10 9 8

r8 d

r4 d

r2 r1

Example of redundancy bit calculation


d
11

d
10 9

d
8

r8 d
7 6

d
5

d
4

r4 d
3 2

r2 r1
1

Input Data 1001101


Adding r1

1
11

0
10

0
9

r8 1
8 7

1
6

0
5 4

r4 1
3 2

r2 1
1

r1=1,3,5,7,9,11 r2=2,3,6,7,10,11 r4=4,5,6,7 r8=8,9,10,11

1
Adding r2
11

0
10

0
9 8

r8 1
7 6

1
5

0
4

r4 1
3 2

0
1

1 1
1

1
Adding r4 11 Adding r8

0
10

0
9

r8 1
8 7

1
6

0
5 4

0
3

1
2

1 1

Output data:10011100101

example
11 10 9 8

Error detecting using hamming code error


7 6 5 4 3 2 1

1 0 0 1 0 1 0 0 1 0 1
r1=1
11 10 9 8 7 6 5 4 3 2 1

If no.1,s is even 0
If no.1,s is odd 1

1 0 0 1 0 1 0 0 1 0 1
r2=1
11 10 9 8 7 6 5 4 3 2 1

8421 0111
r4=1

1 0 0 1 0 1 0 0 1 0 1

7
It mean the 7 bit is corrupted

11

10

1 0 0 1 0 1 0 0 1 0 1
r8=0

example2
11 10 9

error
8 7 6 5 4 3 2 1

0 1 1 1 1 0 0 1 1 1 1
r1=0
11 10 9 8 7 6 5 4 3 2 1

0 1 1 1 1 0 0 1 1 1 1
r2=0
11 10 9 8 7 6 5 4 3 2 1

8421 1000
r4=0

0 1 1 1 1 0 0 1 1 1 1

8
It mean the 8bit is corrupted

11

10

0 1 1 1 1 0 0 1 1 1 1
r8=1

THE END
QUSETION?

You might also like