Professional Documents
Culture Documents
Error Correction
Error Correction
Detection
and
Correction
“Data can be corrupted during transmission.
For reliable communication, errors must be
detected and corrected.”
What is Error?
Ans: Error is a condition when the output information does not match with the
input information. During transmission, digital signals suffer from noise that can
introduce errors in the binary bits travelling from one system to other.
That means a 0 bit may change to 1 or a 1 bit may change to 0.
Error Detection: Error detection is the detection of errors
caused by noise or other impairments during transmission
from the transmitter to the receiver.
Multi bits error: Frame is received with more than one bits in corrupted state.
Sent Received
1 1 0 1 1 1 0 0 0 1
Burst bits error: Frame contains more than1 consecutive bits corrupted..
Sent Received
0 1 0 1 0 0 0 1 0 0
Hamming code: In telecommunication, Hamming codes are a family of
linear error-correcting. Hamming codes can detect up to two-bit or
correct one-bit errors without detection of uncorrected errors.
Parity bit: A parity bit, or check bit is a bit added to the end of a string
of binary code that indicates where the number of bits in the string with
the value one is even or odd. Parity bits are used as the simplest form
of error detecting code.
Error Detection and Correction process:
We are using hamming code for error detection and correction.
Through the four hamming parity bits h1,h2,h3,h4 as 1,2,4 and 8 position with this
word and arrange the 11 bits as follows:
Bit position:
11 10 9 8 7 6 5 4 3 2 1
1 0 1 h4 1 0 0 h3 1 h2 h1
Y = 1011001
Bit position:
11 10 9 8 7 6 5 4 3 2 1
1 0 1 h4 1 0 0 h3 1 h2 h1
11 10 9 8 7 6 5 4 3 2 1
1 0 1 0 1 0 0 1 1 1 0
2 =0 0 1 0
3 =0 0 1 1
4 =0 1 0 0
7 =0 1 1 1
9 =1 0 0 1
11 = 1 0 1 1
0 0 0 0
Y = 1011001
Suppose change 1 to 0 no of bit position 9.
11 10 9 8 7 6 5 4 3 2 1
1 0 0 0 1 0 0 1 1 1 0
2 =0 0 1 0
3 =0 0 1 1
4 =0 1 0 0
7 =0 1 1 1
11 =1 0 1 1
1 0 0 1 =9
11 10 9 8 7 6 5 4 3 2 1
1 0 0 0 1 0 0 1 1 1 0
Y = 1011001
Suppose change 0 to 1no of bit position3.
11 10 9 8 7 6 5 4 3 2 1
1 0 1 0 1 0 0 1 0 1 0
2 =0 0 1 0
4 =0 1 0 0
7 =0 1 1 1
9 =1 0 0 1
11 =1 0 1 1
0 0 1 1 =3
11 10 9 8 7 6 5 4 3 2 1
1 0 0 0 1 0 0 1 0 1 0
Y = 1011001
Suppose change 1 to 0 no of bit position11.
11 10 9 8 7 6 5 4 3 2 1
0 0 1 0 1 0 0 1 1 1 0
2 =0 0 1 0
3 =0 0 1 1
4 =0 1 0 0
7 =0 1 1 1
9 =1 0 0 1
1 0 1 1 = 11
11 10 9 8 7 6 5 4 3 2 1
1 0 0 0 1 0 0 1 1 1 0
USAGE OF HAMMING CODE