Question

The CRC is calculated using the following generator polynomial: x8+x2+x+1 a- Find the CRC bits fo...

The CRC is calculated using the following generator polynomial: x8+x2+x+1

a- Find the CRC bits for the following information bits 1111 0000 0000 0000

b- Can this code detect single errors, double errors, and triple errors? Explain why.

c. Draw the shift register division circuit for this generator polynomial.

0 0
Add a comment Improve this question Transcribed image text
Answer #1

A--

B ---yes this code can detect single errors,double errors and triple errors. In general, all CRC polynomials can detect a single bit error regardless of message length. All CRC polynomials have a "cylic" period.

C----- i need more information.

Add a comment
Know the answer?
Add Answer to:
The CRC is calculated using the following generator polynomial: x8+x2+x+1 a- Find the CRC bits fo...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions
  • Write legibly to receive good rating. Consider a CRC code with a generator polynomial of g(x)...

    Write legibly to receive good rating. Consider a CRC code with a generator polynomial of g(x) -xSx21 a. (15 points) Show step by step (using the longhand division) how to find the codeword that corresponds to information bits of 10011 b. (15 points) Show the shift-register circuit that implements this CRC code. C. Suppose the codeword length is 10. Answer the following questions, with proper justifications i. (10 points) Give an example of undetectable error burst of length 9 ii....

  • Using the polynomial generator: X4+X2+ 1. A shift register encoder is sending the data sequence with polynomial of X4+X3...

    Using the polynomial generator: X4+X2+ 1. A shift register encoder is sending the data sequence with polynomial of X4+X3 +x+1 in systematic form. Demonstrate the resulting CRC division using polynomials.

  • Cyclic Redundancy Check (CRC): Part 1 Answer the following questions: 1. Implement a CRC generator using only '...

    Cyclic Redundancy Check (CRC): Part 1 Answer the following questions: 1. Implement a CRC generator using only 'XOR' gates and shift buffers. Polynomial of the CRC-3 is "l11" which is "X2+X+1". (3 point) Figure 1. An Hardware Implementation of the CRC decoder 2. Suppose the same CRC-3 generator was used for generating a CRC frame and sent to a receiver. The CRC frame received at the receiver was "110101". Answer the following questions. (7 point) What is the bit length...

  • 1) Consider a (15,5) linear block code (cyclic) in systematic form. The generator polynomial is given...

    1) Consider a (15,5) linear block code (cyclic) in systematic form. The generator polynomial is given as g(x) = 1 + x + x2 + x5 + x + x10. a. Design and draw the circuit of the feedback shift register encoder and decoder (6 Marks) b. Use the encoder obtained in part a to find the code word for the message (10110). (Assume the right most bit is the earliest bit) (5 Marks) C. Repeat the steps of part...

  • 1) Consider a (15,5) linear block code (cyclic) in systematic form. The generator polynomial is given...

    1) Consider a (15,5) linear block code (cyclic) in systematic form. The generator polynomial is given as. g(x) = 1 + x + x2 + x5 + x + x10. a. Design and draw the circuit of the feedback shift register encoder and decoder.(6 Marks) b- Use the encoder obtained in part a to find the code word for the message (11101] (Assume the right most bit is the earliest bit) (5 Marks) c- Repeat the steps of part b...

  • 1) (6 pts) A message M = 11101 is to be transmitted from node A to...

    1) (6 pts) A message M = 11101 is to be transmitted from node A to node B using CRC coding. The CRC generator polynomial is G(x) = x2 + 1. a) (2 pts) What is the derived CRC code? Perform the polynomial long division to find this result. (b) (2 pts) Suppose transmitter applies Non-Return-to-Zero Inverted (NRZI) to convert the binary stream of message along with the CRC code to the analog form. What will be the waveform? c)...

  • 2. Perform the following binary multiplications, assuming unsigned integers: B. 10011 x 011 C. 11010 x...

    2. Perform the following binary multiplications, assuming unsigned integers: B. 10011 x 011 C. 11010 x 1011 3. Perform the following binary divisions, assuming unsigned integers: B. 10000001 / 101 C. 1001010010 / 1011 4. Assume we are using the simple model for floating-point representation as given in the text (the representation uses a 14-bit format, 5 bits for the exponent with a bias of 16, a normalized mantissa of 8 bits, and single sign bit for the number ):...

ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT