










Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Single Bit Error Correction, Checksum, Hamming Code, One Complement, Performance of Checksum, Redundancy Bits, Summary are points you can learn these slides.
Typology: Slides
1 / 18
This page cannot be seen from the preview
Don't miss anything!











Types of Redundancy Checks
Longitudinal Redundancy Check
(LRC)
Cyclic Redundancy Check (CRC)
Error detection method used by the higher layers
The unit is divided into k sections, each of n bits
All sections are added and complemented to get the checksum, using one’s complement arithmetic
Detects all errors involving an odd
number of bits
Detects most errors involving an even
number of bits
One pattern remains elusive
Suppose a block of 16 bits need to be sent: 10101001 00111001 10101001 00111001
11100010 Sum 00011101 Checksum
Sent pattern:
10101001 00111001 00011101 checksum Docsity.com
Error is invisible if a bit inversion is balanced by an opposite bit inversion in the corresponding digit of another segment
Segment1 10111101 Segment2 00101001 Checksum 00011001
Sum 11111111
→ The error is undetected
Error correction requires more
redundancy bits than error detection
One additional bit can detect single-bit
errors
r must be able to indicate at least m+r+ states
m+r+1 states must be discoverable by r bits
Therefore, 2r^ ≥ m+r+
If m=7, r=4 as 2 4 ≥ 7+4+