Scribd
Upload
296 views

Chapter 10 Error Detection & Correctio

The document discusses various techniques for error detection and correction in digital communications. It describes parity checks like vertical redundancy check (VRC) and longitudinal redundancy check (LRC) that can detect single-bit errors. Cyclic redundancy checks (CRC) use polynomial division to detect errors and are often represented as algebraic polynomials. Checksums are created by adding data unit sections using one's complement. Error correction codes like Hamming codes add redundant bits that allow the receiver to determine the location of an error and correct it. Diagrams and examples are provided to illustrate Hamming code encoding and error detection/correction.

Uploaded by

zameer2u
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
296 views

Chapter 10 Error Detection & Correctio

The document discusses various techniques for error detection and correction in digital communications. It describes parity checks like vertical redundancy check (VRC) and longitudinal redundancy check (LRC) that can detect single-bit errors. Cyclic redundancy checks (CRC) use polynomial division to detect errors and are often represented as algebraic polynomials. Checksums are created by adding data unit sections using one's complement. Error correction codes like Hamming codes add redundant bits that allow the receiver to determine the location of an error and correct it. Diagrams and examples are provided to illustrate Hamming code encoding and error detection/correction.

Uploaded by

zameer2u
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 26

Chapter 10

Error Detection and Correction

Types of Errors Detection Correction

Single-bit error

Figure 9-4

Burst error

Figure 9-5

Redundancy

VRC (Vertical Redundancy Check)


A parity bit is added to every data unit so that the total number of 1s(including the parity bit) becomes even for even-parity check or odd for odd-parity check VRC can detect all single-bit errors. It can detect multiple-bit or burst errors only the total number of errors is odd.

LRC(Longitudinal Redundancy Check)


Parity bits of all the positions are assembled into a new data unit, which is added to the end of the data block

VRC and LRC

CRC

Binary Division

Detection(contd)
Binary Division in a CRC Checker

Figure 9-12

Polynomial CRC generator(divisor) is most often represented not as a string of 1s and 0s, but as an algebraic polynomial.

WCB/McGraw-Hill

The McGraw-Hill Companies, Inc., 1998

Figure 9-13

Polynomial and Divisor

WCB/McGraw-Hill

The McGraw-Hill Companies, Inc., 1998

Figure 9-14

Standard Polynomials

WCB/McGraw-Hill

The McGraw-Hill Companies, Inc., 1998

Figure 9-15

Checksum

WCB/McGraw-Hill

The McGraw-Hill Companies, Inc., 1998

Figure 9-16

Data Unit and Checksum


To create the checksum the sender does the following: The unit is divided into K sections, each of n bits. Section 1 and 2 are added together using ones complement. Section 3 is added to the result of the previous step. Section 4 is added to the result of the previous step. The process repeats until section k is added to the result of the previous step. The final result is complemented to make the checksum

WCB/McGraw-Hill

The McGraw-Hill Companies, Inc., 1998

Detection(continued)

Figure 9-17

Error Correction

~ can be handled in two ways when an error is discovered, the receiver can have the sender retransmit the entire data unit. a receiver can use an error-correcting code, which automatically corrects certain errors.

WCB/McGraw-Hill

The McGraw-Hill Companies, Inc., 1998

Error Correction
If the total number of bits in a transmittable unit is m+r, then r must be able to indicate at least m+r+1 different states r 2 m+r+1 ex) For value of m is 7(ASCII) , the smallest r value that can satisfy this equation is 4 24 7 + 4 + 1

Figure 9-18

Hamming Code

each r bit is the VRC bit for one combination of data bits r1 = bits 1, 3, 5, 7, 9, 11 r2 = bits 2, 3, 6, 7, 10, 11 r4 = bits 4, 5, 6, 7 r8 = bits 8, 9, 10, 11
WCB/McGraw-Hill

The McGraw-Hill Companies, Inc., 1998

Figure 9-19

Hamming Code

WCB/McGraw-Hill

The McGraw-Hill Companies, Inc., 1998

Figure 9-19-continued

Hamming Code

WCB/McGraw-Hill

The McGraw-Hill Companies, Inc., 1998

Figure 9-20

Example of Hamming Code

WCB/McGraw-Hill

The McGraw-Hill Companies, Inc., 1998

Figure 9-22

Error Detection

WCB/McGraw-Hill

The McGraw-Hill Companies, Inc., 1998

You might also like