Scribd
Upload
93 views

CSE320 Fall19 Assignment 4

The document contains 6 questions about concepts in cyclic redundancy checks (CRC) including: determining CRC codeword length and divisor size given dataword length; performing CRC binary division and using polynomials; checking CRC codeword validity; representing numbers as polynomials and shifting them; identifying CRC generators that guarantee single bit error detection; calculating checksums at sender and receiver sites with and without errors; and finding minimum Hamming distances for error correction and detection.

Uploaded by

Ronak
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
93 views

CSE320 Fall19 Assignment 4

The document contains 6 questions about concepts in cyclic redundancy checks (CRC) including: determining CRC codeword length and divisor size given dataword length; performing CRC binary division and using polynomials; checking CRC codeword validity; representing numbers as polynomials and shifting them; identifying CRC generators that guarantee single bit error detection; calculating checksums at sender and receiver sites with and without errors; and finding minimum Hamming distances for error correction and detection.

Uploaded by

Ronak
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

Assignment 4

1) In CRC, if the dataword is 5 bits and the codeword is 8 bits,


a. how many 0s need to be added to the dataword to make the dividend?
b. What is the size of the remainder?
c. What is the size of the divisor?

2) Given the dataword 101001111 and the divisor 10111, show the generation of the
CRC codeword at the sender site using
a. binary division
b. polynomials
c. Show if the codeword 1010011110100 received is valid or invalid

3) Answer the following questions:


a. What is the polynomial representation of 10111001?
b. What is the result of shifting 10111001 three bits to the left?
c. Repeat part (b) using polynomials.
d. What is the result of shifting 10111001 four bits to the right?
e. Repeat (d) using polynomials.

4) Which of the following CRC generators guarantee the detection of a single bit error?
a. x6 + x + 1
b. x7 + x3
c. 1
d. x2 + 1

5) A sender needs to send the four data items s (A7A2) 16, (CABF)16, (903A)16, and
(A123)16. Answer the following:
a. Find the checksum at the sender site.
b. Find the checksum at the receiver site if there is no error.
c. Find the checksum at the receiver site if the second item is received as CABE.

6) Find the minimum Hamming distance for the following cases:


a. Correction of 3 errors.
b. Detection of 6 errors or correction of 2 errors.

You might also like