Docsity
Docsity

Prepare for your exams
Prepare for your exams

Study with the several resources on Docsity


Earn points to download
Earn points to download

Earn points by helping other students or get them with a premium plan


Guidelines and tips
Guidelines and tips

Errors in Communication-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: Corrupted, Application, Detected, Length, Extra, Redundant, Convolution, Coding, Redundant, Hamming

Typology: Slides

2011/2012

Uploaded on 07/26/2012

shakti
shakti 🇮🇳

4.4

(19)

100 documents

1 / 92

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
10.2
Data can be corrupted
during transmission.
Some applications require that
errors be detected and corrected.
Note
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
pf3b
pf3c
pf3d
pf3e
pf3f
pf40
pf41
pf42
pf43
pf44
pf45
pf46
pf47
pf48
pf49
pf4a
pf4b
pf4c
pf4d
pf4e
pf4f
pf50
pf51
pf52
pf53
pf54
pf55
pf56
pf57
pf58
pf59
pf5a
pf5b
pf5c

Partial preview of the text

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

Data can be corruptedduring transmission.

Some applications require that

errors be detected and corrected.

Note

INTRODUCTION

Let us first discuss some issues related, directly orindirectly, to error detection and correction. Topics discussed in this section: Types of ErrorsRedundancyDetection Versus CorrectionForward Error Correction Versus RetransmissionCodingModular Arithmetic

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

In modulo-N arithmetic, we use only theintegers in the range 0 to N

1, inclusive.

Note

Figure 10.

XORing of two single bits or two words

Figure 10.

Datawords and codewords in block coding

The 4B/5B block coding discussed in Chapter 4 is a goodexample of this type of coding. In this coding scheme,k = 4 and n = 5. As we saw, we have 2

k^

= 16 datawords

and

n^

=^

codewords.

We

saw

that

out

of

codewords are used for message transfer and the rest areeither used for other purposes or unused.

Example 10.

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