Scribd
Upload
20 views1 page

Document 1702388672831

Uploaded by

latad99417
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
20 views1 page

Document 1702388672831

Uploaded by

latad99417
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/ 1

Get 5 free video unlocks on our app with code GOMOBILE Enter your email for an invite 

Search for answers and textbooks Upgrade

Textbooks Ace - AI Tutor NEW Ask our Educators Study Tools For Educators My Class

QUESTION ANSWERED

Given the dataword 10100110101 and the divisor 10101, show the…
Given the dataword 10100110101 and the divisor 10101, show the generation of the CRC codeword at the sender
side (using binary division). Now convert the dataword and divisor into polynomials and show the generation of
the CRC codeword at the sender side. [For practice, corrupt the leftmost bit or any other bit, and verify if the
CRC technique is able to detect the error at the receiver side or not.]

Submitted by Andrew L. Sep. 07, 2023 09:02 p.m.

INSTANT ANSWER

Step 1/3
Step 1: Binary Division First, we append the number of zeros equal to the degree of the divisor (which is 4 in this case) to the end of the dataword. So,
the dataword becomes 101001101010000. Now, we perform binary division: 101001101010000 / 10101 The result of the division is 1000110110 and the
remainder is 1101. So, the CRC codeword generated at the sender side is the original dataword appended with the remainder: 101001101011101.

Step 2/3
Step 2: Polynomial Division The dataword 10100110101 can be represented as the polynomial x^10 + x^8 + x^6 + x^4 + x^2 + 1. The divisor 10101 can be
represented as the polynomial x^4 + x^2 + 1. Performing polynomial division, we get the quotient as x^6 + x^5 + x^3 + x + 1 and the remainder as x^3 +
x^2 + 1. So, the CRC codeword generated at the sender side is the original dataword polynomial appended with the remainder polynomial: x^10 + x^8 +
x^6 + x^4 + x^2 + 1 + x^3 + x^2 + 1.

Answer
Step 3: Error Detection Let's corrupt the leftmost bit of the codeword. So, the received codeword becomes 001001101011101.
Performing binary division with the divisor, we get the remainder as 1010, which is not zero. Therefore, the CRC technique is able to
detect the error at the receiver side. Similarly, if we corrupt any other bit, the CRC technique will be able to detect the error as the
remainder of the division will not be zero.

VIDEO ANSWER EXPERT SOLVED

Solved on Dec. 9, 2023, 11:31 a.m.

AP CS Notes

Error correcting systems design ECE635 Computer Networks CSCI 690 Internetworking EE 281 Computer Architecture CS 3375

Computer Network Concepts CNT 3004

HW3 Solv3 - Lecture notes, CS 3375 Practice Cyclic codes Lecture notes, Computer
Assignment s… lecture L… Problem… definitions lecture L… network - It is…
San Jos?© State U… University of Cen… Texas Tech Univer… California State … University of Cen… New York Institut…
Internetworking E… Computer Network Computer Architec… Error correcting … Computer Network Computer
… … Networks…

View all of your school notes

Suggested Textbook

You might also like