Scribd
Upload
54 views4 pages

Computer Network (EC-602) - Suvradip Maity

Cyclic redundancy check (CRC) is a method for detecting errors in digital data during transmission or storage. It works by calculating a checksum based on the contents of a message and attaching that to the message. The receiver recalculates the checksum and compares it to the one attached to ensure no errors occurred in transmission. CRC can detect single and burst errors. A CRC generator performs a modulo-2 division of the message to calculate the checksum, and a CRC checker performs the same division to validate the message on receipt. If the remainder is zero, then no errors were detected.

Uploaded by

The Remix World
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
54 views4 pages

Computer Network (EC-602) - Suvradip Maity

Cyclic redundancy check (CRC) is a method for detecting errors in digital data during transmission or storage. It works by calculating a checksum based on the contents of a message and attaching that to the message. The receiver recalculates the checksum and compares it to the one attached to ensure no errors occurred in transmission. CRC can detect single and burst errors. A CRC generator performs a modulo-2 division of the message to calculate the checksum, and a CRC checker performs the same division to validate the message on receipt. If the remainder is zero, then no errors were detected.

Uploaded by

The Remix World
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/ 4

CYCLIC REDUNDANCY CHECK

Name – Suvradip Maity


Dept. – ‘ECE’ Year – 6th sem
Roll No.- EC/20/04
Sub.- Computer Network (EC-602)

Content
1.Introduction
2.Types of error
3. CRC generator and checker
4. Process
5. CRC Checker
6. Conclusion

1. Introduction
Cyclic Redundancy Checks (CRC) is the most powerful method for Error-
Detection and Correction. It is given as a kbit message and the transmitter
creates an (n – k) bit sequence called frame check sequence. The out
coming frame, including n bits, is precisely divisible by some fixed number.
Modulo 2 Arithmetic is used in this binary addition with no carries, just like
the XOR operation. Redundancy means delicacy. The redundancy bits used
by CRC are changed by splitting the data unit by a fixed divisor. The
remainder is CRC.

2. Static Calibration
2. Types of error-
• Single bit error
It occurs when one bit of data unit gets corrupted during transmission. Which
means that only one bit of a given data unit is changed from 1 to 0 or 0 to 1 It
can be easily detected and corrected.
Sent data — 1 1 1 0 1 1 0 1
(1 is changed to 0)
Received data —— 1 0 1 0 1 1 0 1 Burst Error
It occurs when 2 or more bits in the data unit get corrupted during
transmission, also known as multiple bit error. It means that the 2 or more bits
have changed from 1 to 0 or 0 to 1. It is difficult to be detected and corrected.
It is likely to occur in a serial data transmission.
For example,
Multiple bit below are changed –
Sent Data ———-1 1 1 0 1 1 0 1
Received Data —-1 0 1 0 0 1 1 1

Data: The information to be transmitted in the form of bits is recognized as data.


Message: Message is the composition of data bits and the CRC bits generated
using CRC generator algorithm. It is described as the data unit. To proof the
correctness of data in CRC technique, the message operated under binary
division using generating polynomial as the divisor, its remainder must be Zero.

3. CRC generator and checker-


1) A CRC generator uses a modulo-2 division. Firstly, three zeroes are
appended at the end of the data as the length of the divisor is 4 and
we know that the length of the string 0s to be appended is always one
less than the length of the divisor.
2) Now, the string becomes 11100000, and the resultant string is
divided by the divisor 1001.
3) Remainder generated from the binary division is known as CRC
remainder. The generated value of the CRC remainder is 111.
4) CRC remainder replaces the appended string of 0s at the end of the
data unit, and the final string would
be 11100111 which is sent across the network.

4. Process-

Example -
5. CRC Checker -
The functionality of the CRC checker is similar to the CRC
generator. When the string 11100111 is received at the receiving end,
then CRC checker performs the modulo-2 division. A string is divided
by the same divisor, i.e., 1001.In this case, CRC checker generates the
remainder of zero. Therefore, the data is accepted.

6. CONCLUSION –
Cyclic Redundancy Check is a powerful algorithm that is used
for error control in the data link layer. The number of 0 bits appended
on the sender's side is equal to the highest number of polynomial
degrees. If the receiver side gets the remainder as 0 after performing
the division, then there is no error in receiving the data at the
receiver's end. CRC is used to detect single-bit errors, odd errors, and
burst errors of length N (where N is the highest degree of the
generator polynomial).

You might also like