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

Solution

The document outlines methods for error detection and correction using generator polynomials and CRC codes. It details steps for calculating transmitted codes, detecting errors in received data, and constructing a 2-D parity matrix for ASCII codes. The approach ensures double error detection and single error correction.

Uploaded by

nhhhgggggbjju
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
0% found this document useful (0 votes)
3 views2 pages

Solution

The document outlines methods for error detection and correction using generator polynomials and CRC codes. It details steps for calculating transmitted codes, detecting errors in received data, and constructing a 2-D parity matrix for ASCII codes. The approach ensures double error detection and single error correction.

Uploaded by

nhhhgggggbjju
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

Solutions

1. Generator Polynomial and Error Detection

(a) Finding the code the transmitter will send:

- Data: 1100011

- Generator polynomial g(x) = x^3 + x + 1 = 1011

Steps:

1. Append 3 zeros: 1100011000

2. Perform binary (mod-2) division of 1100011000 by 1011.

3. The remainder (R) is calculated.

4. Transmitted code = original data + R.

(b) Error detection:

- Received data (with errors at bit 4 and 6): 1101001

- Perform binary division of 1101001 by 1011.

- If remainder is non-zero => error detected.

2. CRC Codeword Calculation

- Generator sequence: g = 101


Solutions

- Information sequence: i = 1101101

Steps:

1. Append 2 zeros to i: 110110100

2. Perform binary (mod-2) division by g = 101.

3. The remainder is appended to i to form the codeword c.

3. 2-D Parity Construction

Given ASCII codes:

- M = 1001011

- T = 1001010

- I = 1010100

Steps:

1. Arrange the bits in a 3x7 matrix.

2. Add an even parity bit at the end of each row.

3. Add an even parity bit at the bottom of each column.

4. Add an overall parity bit for the parity bits.

This ensures double error detection and single error correction.

You might also like