CN

Cyclic Redundancy Check (CRC)

Medium
EST. TIME: 45 min

Cyclic Redundancy Check (CRC)

To demonstrate Error Detection using Cyclic Redundancy Check (CRC).

Theory & Concepts

Click to collapse detailed explanation

1. Introduction

Data can get corrupted during transmission due to noise. **CRC** is a robust error-detection technique using polynomial division. It is widely used in Ethernet, Wi-Fi, and ATM.

2. Working Principle

  1. Both sender and receiver agree on a **Generator Polynomial** (Divisor).
  2. Sender appends 0s to the Data unit (equal to degree of generator).
  3. Sender divides the augmented data by the generator (Binary Division).
  4. The **Remainder** (CRC) is appended to the original data and sent.
  5. Receiver divides the received data by the same generator.
  6. If Remainder is **0**, data is correct. If non-zero, error detected.

3. Example

Data: 1101
Generator: 1011

1. Append 3 zeros: 1101000
2. Divide 1101000 by 1011
3. Remainder = 001
4. Send: 1101001

Procedure

1

Enter Data

Input a binary string (e.g., 101101).

2

Choose Divisor

Select CRC-8 or CRC-32 polynomial.

3

Calculate

Click generate to see the step-by-step binary division animation.

Learning Resources

Animated Lecture

CRC Error Detection

Reference Notes

CRC Steps

Self Quiz

Error Detection Quiz

Ready to Start?

Launch the virtual simulator to visualize the network layers and verify protocols.

Lab Status

Active Simulation

Hi, how can I help you Today!