0% found this document useful (0 votes)
1 views2 pages

Question Answer

Uploaded by

chandu10756
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
1 views2 pages

Question Answer

Uploaded by

chandu10756
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd

Subject: Solution for Cyclic Redundancy Check (CRC) Problems

Part 1: CRC Calculation*

Problem Statement:
Use the generator polynomial G(x) = x³ + 1 to compute the CRC bits
for the data word 110101. Show the transmitted frame.

Solution Steps:

1. Identify Data and Generator:


* Data Word (D): 110101
* Generator Polynomial G(x): x³ + 1
* This corresponds to the binary generator pattern (P): 1001

2. *Determine CRC Bits:*


* The degree of the generator polynomial is 3. Therefore, the
number of CRC bits (r) is 3.
* Append 3 zeros to the data word to prepare for division.

3. *Augmented Data:*
* The data word with 3 appended zeros is: 110101000

4. *Binary Division (Modulo-2):*


We divide 110101000 by 1001.

110011
_________
1001| 110101000
- 1001
------
1000
- 1001
------
0011
- 0000
------
0110
- 0000
------
1100
- 1001
------
1010
- 1001
------
011 <-- Remainder (CRC bits)

5. Final Result:
* The remainder of the division is *011*. These are the CRC
bits.
* The transmitted frame is the original data followed by the
CRC bits.
* Transmitted Frame (T) = 110101 + 011 = *110101011*
------------------------------------------------------------------
-

*Part 2: Error Verification*

*Problem Statement:*
A frame 1001101 is received with CRC using generator polynomial
G(x) = x² + x + 1. Verify whether an error has occurred.

*Solution Steps:*

1. *Identify Received Frame and Generator:*


* Received Frame (T'): 1001101
* Generator Polynomial G(x): x² + x + 1
* This corresponds to the binary generator pattern (P): 111

2. *Verification Process:*
* The receiver divides the entire received frame by the
generator.
* If the remainder is zero, no detectable error has occurred.
* If the remainder is non-zero, an error has been detected.

3. *Binary Division (Modulo-2):*


We divide 1001101 by 111.

11111
________
111 | 1001101
- 111
-----
0111
- 111
-----
0001
- 000
-----
0010
- 000
-----
0101
- 111
-----
010 <-- Remainder

4. Final Result:
* The remainder of the division is *010*.
* Since the remainder is *not zero, we can conclude that **an
error has occurred* in the transmission.

You might also like