[go: up one dir, main page]
Scribd
Upload
5 views3 pages

Unit-2 Sample Problems

The document discusses the application of the CRC technique for error detection and correction, specifically using a polynomial divisor. It also explains Hamming Code for error correction, detailing how redundancy bits are added to data units to detect and correct single-bit errors. The document includes conditions for error detection and examples of redundancy bit calculations in Hamming Code.

Uploaded by

javidinaug77
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
5 views3 pages

Unit-2 Sample Problems

The document discusses the application of the CRC technique for error detection and correction, specifically using a polynomial divisor. It also explains Hamming Code for error correction, detailing how redundancy bits are added to data units to detect and correct single-bit errors. The document includes conditions for error detection and examples of redundancy bit calculations in Hamming Code.

Uploaded by

javidinaug77
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

1.

Apply CRC technique to append CRC bits on sender side and verify whether the
polynomial 100100 with divisor 1101 is error free on receiver side.
CRC Generator:

CRC Checker
2. Error Correction using Hamming Code – Example Problem
Single-bit errors:
a. Can be detected by the addition of parity bit which helps to find “error” or “no
error” which is sufficient to detect errors
b. To correct errors the receiver can simply invert 0 to 1 or 1 to 0, but the problem is
“locating” the position of error
c. To do so requires enough redundancy bits
d. Condition: 2r >= m + r + 1

Hamming Code
• Hamming Code can be applied to data units of any length and uses the relationship
between data and redundancy bits
• For example: a 7-bit ASCII code requires 4 redundancy bits that can be added to the end
of the data unit or mixed with the original data bits, which are placed in positions 1, 2, 4,
and 8 i.e., x0, x1, x2, x3 and so on.

Positions of Redundancy bits in Hamming Code

• In the Hamming Code, each “r” bit for one combination of data bits as below:
r1: bits 1, 3, 5, 7, 9, 11
r2: bits 2, 3, 6, 7, 10, 11
r3: bits 4, 5, 6, 7
r4: bits 8, 9, 10, 11

Example of Redundancy bit Calculation


Error Detection-Using Hamming Code

You might also like