Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
109 views

Error Detection and Correction: Anan Phonphoem, PH.D

The document discusses error detection and correction in digital communications. It defines three types of errors: single-bit errors, multiple-bit errors, and burst errors. It then describes common detection methods like vertical redundancy checks, longitudinal redundancy checks, cyclic redundancy checks, and checksums. The document also introduces Hamming codes, which allow for error correction by adding redundant bits that can identify specific bit locations with errors.

Uploaded by

Shaikh Kashif
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
109 views

Error Detection and Correction: Anan Phonphoem, PH.D

The document discusses error detection and correction in digital communications. It defines three types of errors: single-bit errors, multiple-bit errors, and burst errors. It then describes common detection methods like vertical redundancy checks, longitudinal redundancy checks, cyclic redundancy checks, and checksums. The document also introduces Hamming codes, which allow for error correction by adding redundant bits that can identify specific bit locations with errors.

Uploaded by

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

Errors

Error Detection and Correction

ดร. อนันต ผลเพิ่ม


Single-Bit Multiple-Bit Burst
Anan Phonphoem, Ph.D.
anan@cpe.ku.ac.th
http://www.cpe.ku.ac.th/~anan
Computer Engineering Department
Kasetsart University, Bangkok, Thailand

Single-bit error Multiple-bit error

3 4

How do we know that data is


Burst error corrupted (errors occur)?
„ Æ How to detect the error?
„ Does not know at the signal level
„ Comparison…
„ Æ Redundancy
„ 2 copies of everything (slow, high overhead)
„ Extra info.

5 6
Redundancy
Detection Methods

VRC LRC CRC Checksum

Vertical Redundancy Check Longitudinal Redundancy


(VRC) - parity Check (LRC)

n bits
•Can detect n bits burst error
•>n bits can be detected Æhigh prob.

9 10

Cyclic Redundancy Check


VRC and LRC (CRC)

11 12
Binary Division in a CRC gen. Polynomial

13 14

Polynomial and Divisor Standard Polynomials


2 properties
„ Should not divisible by x

„ Should be divisible by (x+1)

15 16

Notes:
•Segment
•Add using one’s complement
CRC Checksum •Sum is complemented

„ Very effective detection method


„ Can detect all burst of length < degree
of polynomial
„ Detect other errors Æhigh prob.

17 18
Data Unit and Checksum When the error is detected:
„ How can we correct them?
„ Discarded and resent
„ Automatically correct without resent
„ In theory, any error binary code can be
corrected
„ But adding complexity
„ Redundancy
„ Limited up to 3 errors because of overhead

19 20

Error Correction Number of redundancy bit


„ Total bit = m+r
„ r must be able to indicate all positions
including no error Æ m+r+1
„ r bit can indicate 2r states
„ So 2r >= m+r+1
„ For ASCII (7bits) Æ m = 7
„ 24 >= 7+4+1

21 22

Hamming Code Hamming Code


„ Example: 7-bit ASCII needed r = 4

23 24
Hamming Code Example of Hamming Code

Each bit is
covered
by at least
2 checkers

25 26

Single-bit error Error Detection

27 28

You might also like