Sidra Akram I:D MC190405014

Question No. 1

Suppose a message consisting of following four-bit numbers is being sent to a

destination. By writing all necessary calculation steps, you are required to calculate
four-bit Checksum number, the sender will append with the original message:

9, 8,11, 15, 14

Solution: Given data = 9,8,11,15,14

Sum of the numbers=9+8+11+15+14
Sum: 57
(9+9+11+15+14) is the message appended with the check, sum where 57 is the
sumoforiginal number.
Here the = 9+8+11+15+14 are 4-bits because each number less then 15
The number 57 cannot be written in 4-bits

Binary of 57 is equal to (111001) which is also greater then 4 bits

Binary of 57 = 11001
By adding 1001
+11 =1100
1100 in decimal =12
Sum = 57
Wrapped Sum= 12
One compliment = 1100
0011
0011 in decimal = 3
The sender will append 3 as 4-bit check sum with original message .

Question No.2
 3
Considering the Generator Polynomial (Divisor): X +1, by writing all necessary

calculations steps involved in Cyclic Redundancy Check, you are required to

determine the codeword of the following data word:

10110

Answer: Poly nomial = x3 +1

The degree of poly nomial = 3
Original data word=1011
10100

The Size of CRC 10100 10110000

Is there we must 1001

Add three zero to *0100
The right side of 0000
Oroginal data as show *1000
Below 10110000 1001
*0010
0000
*0100
0000
 *100
* Sender side = 10110100
We send our data 10110 its
Its reminder (CRC) will be added with it like 10110100.
* Receiver will receive 10110100 with same divisor 1001

G=1001
Data=10110
Degree = 3

10100

1001 10110100
1001
*0100
0000
*1001
1001
*0000
0000
*0000
0000
*000
Question No.3

Find the Polynomials equivalent of bits given in the following table:

Bits Polynomial
1010000
10001001
Solution: I) x  x  0
6 4

II) x  x  1
7 3