Thanks to visit codestin.com
Credit goes to www.scribd.com

Scribd
Upload
44 views2 pages

CRC Questions

The document presents two questions related to Cyclic Redundancy Check (CRC) coding. Question 1 involves encoding a 4-bit message into a CRC codeword, receiving it with errors, and performing a CRC check to detect errors. Question 2 requires deriving an 8-bit codeword from a 4-bit message with CRC and parity bits, and checking the integrity of a received codeword to determine the likely number of bit errors.

Uploaded by

fanwenjie1010
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
44 views2 pages

CRC Questions

The document presents two questions related to Cyclic Redundancy Check (CRC) coding. Question 1 involves encoding a 4-bit message into a CRC codeword, receiving it with errors, and performing a CRC check to detect errors. Question 2 requires deriving an 8-bit codeword from a 4-bit message with CRC and parity bits, and checking the integrity of a received codeword to determine the likely number of bit errors.

Uploaded by

fanwenjie1010
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/ 2

Question 1

A 4-bit data message (m3 m2 m1 m0) = (1000) is encoded into a


Cyclic Redundancy Check (CRC) codeword, using the CRC
generator g(x) = x3+x+1, and transmitted over a noisy channel. The
message is received with 3 bit errors as (0011), the CRC bits being
all correct. Perform a CRC check on this received data for error
detection and explain your result.
Question 2

a. A 4-bit message (m3m2m1m0) = (1100) is encoded into an 8-bit codeword


by adding to it 3 Cyclic Redundancy Check (CRC) bits (c2 c1 c0) and an
overall even parity bit (p) in the following order (m3m2m1m0 c2 c1 c0 p). The
CRC bits are generated using the generator polynomial g(x) = x3+x+1.
Derive the resulting 8-bit codeword.

b. After transmission over a Gaussian channel, an 8-bit codeword


constructed as in a., is received as 11110101. Check the integrity of the
received codeword and explain what is the most likely number of bits
errors that might have occurred.

You might also like