Error Detection and Correction-Basic Data Communication Systems-Lecture Slides, Slides of Digital Systems Design

This lecture is part of lecture series on Data Communication Systems. It was delivered by Prof. Prajin Ahuja at Birla Institute of Technology and Science. Its main points are: Error, Detection, Coreection, Length, Burst, Corrupted, Redundacy, Correct, unreliable, Transmission

Typology: Slides

2011/2012

Uploaded on 07/26/2012

shakti
shakti 🇮🇳

4.4

(19)

99 documents

1 / 58

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
Error Detection
and
Correction
docsity.com
pf3
pf4
pf5
pf8
pf9
pfa
pfd
pfe
pff
pf12
pf13
pf14
pf15
pf16
pf17
pf18
pf19
pf1a
pf1b
pf1c
pf1d
pf1e
pf1f
pf20
pf21
pf22
pf23
pf24
pf25
pf26
pf27
pf28
pf29
pf2a
pf2b
pf2c
pf2d
pf2e
pf2f
pf30
pf31
pf32
pf33
pf34
pf35
pf36
pf37
pf38
pf39
pf3a

Partial preview of the text

Download Error Detection and Correction-Basic Data Communication Systems-Lecture Slides and more Slides Digital Systems Design in PDF only on Docsity!

Error Detection

and

Correction

Data can be corruptedduring transmission.

Some applications require that

errors be detected and corrected.

Note

Figure 10.

Single-bit error

A burst error means that 2 or more bits

in the data unit have changed.

Note

Note To detect or correct errors, we need tosend extra (redundant) bits with data.

Figure 10.

The structure of encoder and decoder

BLOCK CODING

In block coding, we divide our message into blocks,each of k bits, called datawords. We add r redundantbits to each block to make the length n = k + r. Theresulting n-bit blocks are called codewords.

Figure 10.

Datawords and codewords in block coding

Let us assume that k = 2 and n = 3. Table 10.1 shows the

list of datawords and codewords. Later, we will seehow to derive a codeword from a dataword. Assume the sender encodes the dataword 01 as 011 andsends it to the receiver. Consider the following cases:1. The receiver receives 011. It is a valid codeword. The

receiver extracts the dataword 01 from it.

Example 10.

  1. The codeword is corrupted during transmission, and

111 is received. This is not a valid codeword and isdiscarded.

  1. The codeword is corrupted during transmission, and

000 is received. This is a valid codeword. The receiverincorrectly extracts the dataword 00. Two corruptedbits have made the error undetectable.

Example 10.2 (continued)

An error-detecting code can detect

only the types of errors for which it isdesigned; other types of errors may

remain undetected.

Note

Figure 10.

Structure of encoder and decoder in error correction

Comparing

the

received

codeword

with

the

first

codeword

in

the

table

versus

the

receiver decides that the first codeword is not the onethat was sent because there are two different bits.

  1. By the same reasoning, the original codeword cannot

be the third or fourth one in the table.

  1. The original codeword must be the second one in the

table because this is the only one that differs from thereceived

codeword

by

bit.

The

receiver

replaces

01001 with 01011 and consults the table to find thedataword 01.

Example 10.3 (continued)

Table 10.

A code for error correction (Example 10.3)