Download as docx, pdf, or txt
Download as docx, pdf, or txt
You are on page 1of 4

UNIVERSITI TEKNOLOGI MARA SHAH ALAM

COLLEGE OF COMPUTING, INFORMATIC AND MATHEMATICS


ITT 400
TUTORIAL 6: Error Detection

Name:’Aina Nadiah Binti Mohd Zainal Fithri


Class:CDCS2532A
Subject: ITT400
Instructions
a. Answer all questions.
b. Please submit your tutorial in Google Classroom in PDF File.

1. Exclusive-OR (XOR) is one of the most used operations in the calculation of


codewords. Apply the exclusive-OR operation on the following pairs of patterns.
Interpret the results.
a. (11001) ⊕ (10001) = 01000
b. (11100) ⊕ (00000) = 11100
c. (10011) ⊕ (11111) = 01100

2. Refer the above answers. What is the hamming distance and what is the dmin?
a. d=2
b. d= 3
c. d= 3
dmin=2

3. Find the polynomial equivalent of


i. 101011101= x^8+x^6+x^4+x^3+x^2+1
ii. 110010101 = x^8+x^7+x^4+x^2+1
iii. 110011 = x^%+x^4+x^1+1
iv. 100110 = x^5+x^2+x^1

4. Discuss the concept of redundancy in error detection and correction.


Redundancy in error detection and correction refers to the inclusion of extra bits or data in a
transmitted message to enable the detection and correction of errors. Redundant bits do not
carry information but are used to check the integrity of the received data.
UNIVERSITI TEKNOLOGI MARA SHAH ALAM
COLLEGE OF COMPUTING, INFORMATIC AND MATHEMATICS
ITT 400
5. Find the parity bits for the following bit pattern using Two-Dimensional Parity Check and
Checksum. Assume EVEN parity. Show your work.

i. 1100111 1011111 1111001 0111101

1100111

1011111

1111001

0111101

Row Parities:

1100111 (odd) -> 11001110

1011111 (even) -> 10111110

1111001 (odd) -> 11110010

0111101 (odd) -> 01111010

Column Parities:

11001110

10111110

11110010

01111010

-----------

01100000 (even parity for the extra row)

Sum = 1100111 + 1011111 + 1111001 + 0111101 = 11000000

Checksum = 11000000 (already even)


UNIVERSITI TEKNOLOGI MARA SHAH ALAM
COLLEGE OF COMPUTING, INFORMATIC AND MATHEMATICS
ITT 400
ii. 1100100 1001010 1010001 1001010

1100100

1001010

1010001

1001010

Row Parities:

1100100 (odd) -> 11001001

1001010 (even) -> 10010100

1010001 (odd) -> 10100010

1001010 (even) -> 10010100

Column Parities:

11001001

10010100

10100010

10010100

-----------

00111111 (even parity for the extra row)

Sum = 1100100 + 1001010 + 1010001 + 1001010 = 10011001

Checksum = 10011001 (already even)


UNIVERSITI TEKNOLOGI MARA SHAH ALAM
COLLEGE OF COMPUTING, INFORMATIC AND MATHEMATICS
ITT 400
6. Given the data word 1101011111 and the divisor 11011, show the generation of the
codeword at the sender side (show your work).

7. Assuming even parity, find the parity bit for each of following data units.

a. 1101011
b. 0101100

8. Explain the principle of operation of a CRC error detection method by showing;

a. The generation of the codeword at the sender site


b. The checking of the codeword at the receiver site

9. Use the generator polynomial X4 + X2 + 1 and data 1010011110

10. Given that a computer receives four data items 235516, A44E16, 57B416, and E2C716. By
using ‘checksum’ error detection method, determine whether the received data items will
be accepted or rejected (show your work)

11. Assume a polynomial x2 + 1. A 10-bit sequence 11 0110 1101 is going to be sent. Find
the CRC. Show your checking and calculation.

You might also like