Scribd
Upload
9 views

Error Detection and Correction

Error correction and detection techniques How error are detected in a data on a network and. What methods are used to correct those errors

Uploaded by

Musharraf Sardar
Copyright
© © All Rights Reserved
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
9 views

Error Detection and Correction

Error correction and detection techniques How error are detected in a data on a network and. What methods are used to correct those errors

Uploaded by

Musharraf Sardar
Copyright
© © All Rights Reserved
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 21

Error Detection and Correction

Continued
Example 10.7

The minimum Hamming distance for our first code scheme


(Table 10.1) is 2. This code guarantees detection of only a
single error. For example, if the third codeword (101) is
sent and one error occurs, the received codeword does not
match any valid codeword. If two errors occur, however,
the received codeword may match a valid codeword and
the errors are not detected.

10.2
Example 10.8

Our second block code scheme (Table 10.2) has d min = 3.


This code can detect up to two errors. Again, we see that
when any of the valid codewords is sent, two errors create
a codeword which is not in the table of valid codewords.
The receiver cannot be fooled.

However, some combinations of three errors change a


valid codeword to another valid codeword. The receiver
accepts the received codeword and the errors are
undetected.

10.3
Example 10.9

A code scheme has a Hamming distance dmin = 4. What is


the error detection and correction capability of this
scheme?

Solution
This code guarantees the detection of up to three errors
(s = 3), but it can correct up to one error. In other words,
if this code is used for error correction, part of its capability
is wasted. Error correction codes need to have an odd
minimum distance (3, 5, 7, . . . ).

10.4
10-3 LINEAR BLOCK CODES

Almost all block codes used today belong to a subset


called linear block codes. A linear block code is a code
in which the exclusive OR (addition modulo-2) of two
valid codewords creates another valid codeword.

Topics discussed in this section:


Minimum Distance for Linear Block Codes
Some Linear Block Codes

10.5
Note
In a linear block code, the exclusive OR (XOR) of any two valid codewords creates
another valid codeword.

10.6
Example 10.10

Let us see if the two codes we defined in Table 10.1 and


Table 10.2 belong to the class of linear block codes.

1. The scheme in Table 10.1 is a linear block code


because the result of XORing any codeword with any
other codeword is a valid codeword. For example, the
XORing of the second and third codewords creates the
fourth one.

2. The scheme in Table 10.2 is also a linear block code.


We can create all four codewords by XORing two
other codewords.
10.7
Example 10.11

In our first code (Table 10.1), the numbers of 1s in the


nonzero codewords are 2, 2, and 2. So the minimum
Hamming distance is dmin = 2. In our second code (Table
10.2), the numbers of 1s in the nonzero codewords are 3, 3,
and 4. So in this code we have dmin = 3.

10.8
Table 10.3 Simple parity-check code C(5, 4)

10.9
Figure 10.10 Encoder and decoder for simple parity-check code

10.10
Example 10.12

Let us look at some transmission scenarios. Assume the


sender sends the dataword 1011. The codeword created
from this dataword is 10111, which is sent to the receiver.
We examine five cases:

1. No error occurs; the received codeword is 10111. The


syndrome is 0. The dataword 1011 is created.
2. One single-bit error changes a1 . The received
codeword is 10011. The syndrome is 1. No dataword
is created.
3. One single-bit error changes r0 . The received codeword
is 10110. The syndrome is 1. No dataword is created.
10.11
Example 10.12 (continued)

4. An error changes r0 and a second error changes a3 .


The received codeword is 00110. The syndrome is 0.
The dataword 0011 is created at the receiver. Note that
here the dataword is wrongly created due to the
syndrome value.
5. Three bits—a3, a2, and a1—are changed by errors.
The received codeword is 01011. The syndrome is 1.
The dataword is not created. This shows that the simple
parity check, guaranteed to detect one single error, can
also find any odd number of errors.

10.12
Note
A simple parity-check code can detect an odd number of errors.

10.13
Note
All Hamming codes discussed in this book have dmin = 3.

The relationship between m and n in these codes is n = 2m − 1.

10.14
Figure 10.11 Two-dimensional parity-check code

10.15
Figure 10.11 Two-dimensional parity-check code

10.16
Figure 10.11 Two-dimensional parity-check code

10.17
Table 10.4 Hamming code C(7, 4)

10.18
Figure 10.12 The structure of the encoder and decoder for a Hamming code

10.19
Table 10.5 Logical decision made by the correction logic analyzer

10.20
Example 10.13

Let us trace the path of three datawords from the sender to


the destination:
1. The dataword 0100 becomes the codeword 0100011.
The codeword 0100011 is received. The syndrome is
000, the final dataword is 0100.
2. The dataword 0111 becomes the codeword 0111001.
The syndrome is 011. After flipping b2 (changing the 1
to 0), the final dataword is 0111.
3. The dataword 1101 becomes the codeword 1101000.
The syndrome is 101. After flipping b0, we get 0000,
the wrong dataword. This shows that our code cannot
correct two errors.
10.21

You might also like