ErrorDetectionandCorrection.pptVIP

Error Detection Enough redundancy is added to detect an error. The receiver knows an error occurred but does not know which bit(s) is(are) in error. Has less overhead than error correction. * McGraw-Hill The McGraw-Hill Companies, Inc., 2000 Chapter 10 Error Detection and Correction Copyright ? The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Data can be corrupted during transmission. Some applications require that errors be detected and corrected. Note 10-1 INTRODUCTION Let us first discuss some issues related, directly or indirectly, to error detection and correction. Types of ErrorsRedundancyDetection Versus CorrectionForward Error Correction Versus RetransmissionCoding Modular Arithmetic Topics discussed in this section: In a single-bit error, only 1 bit in the data unit has changed. Note Figure 10.1 Single-bit error A burst error means that 2 or more bits in the data unit have changed. Note Figure 10.2 Burst error of length 8 To detect or correct errors, we need to send extra (redundant) bits with data. Note Figure 10.3 The structure of encoder and decoder In this book, we concentrate on block codes; we leave convolution codes to advanced texts. Note In modulo-N arithmetic, we use only the integers in the range 0 to N ?1, inclusive. Note Figure 10.4 XORing of two single bits or two words 10-2 BLOCK CODING In block coding, we divide our message into blocks, each of k bits, called datawords. We add r redundant bits to each block to make the length n = k + r. The resulting n-bit blocks are called codewords. Error DetectionError CorrectionHamming Distance Minimum Hamming Distance Topics discussed in this section: Figure 10.5 Datawords and codewords in block coding The 4B/5B block coding discussed in Chapter 4 is a good example of this type of coding. In this coding scheme, k = 4 and n = 5. As we saw, we have 2k = 16 datawords and 2n = 32 codewords. We saw that 16 out of 32 codewords are used for message transfe