Assignment 1 2

KARUME INSTITUTE OF SCIENCE AND
TECHNOLOGY
EGU 07522 Networks and Data

Communications
Assignment Number 1
To be Submitted to: Mr. Ali A. Abdulla,

Electrical Engineering Department.
Submitted by: Wardat John Komesha (KIST/BEE/20/0004)
Yasini Twaha Omary (KIST/BEE/20/0026)
Submission Date: 23 December, 2022.
Question 1
NO!,the receiver will not detect the error.Because the parity checker at
the receiver can not detect the two bits error.Hence the Data words will
be received as there are no errors but in reality there are two bits which
are in erroneous
Question 2
Data provided;
Total number of bits in the frame (F) = 8
Probability of bit error (Pb) = 10-3
Required;
(a)The probability that that received frame contains atleasst one error.
(b)The probability after adding parity to each character.
Solution;
(a).
From,
P1=(1-Pb)F
P1+P2=1
P2=1-(1-Pb)F
Now,
P2=1-(1-10-3)8
P2≈0.00798.
Therefore,
The probability that received frame contains atleast one error is
0.00798.
(b).
Now,
P2=1-(1-10-3)10
P2≈0.009955
Hence,
Here the probability that a received frame contains atleast one
error bit is 0.009955.
Question 3
Checksum at sender Checksum at receiver

E3 E3
4F 4F
23 23
96 96
44 44
27 27
99 99
F3 F3
(49 )16 b6
FF
Complement(49)16= b6
Checksum=b6 Complement(FF)=00
Question 4
Checksum does not need to take into account endianness because
checksum is the same no matter what order the bytes they are.Checksum
does adding which are commutative.
Question 5
Solution:
(a) In the case of one bit error,it can be detected and corrected
because two affected parity bits can determine and define
where the error is.
(b) Two errors can definetly determined because they affect two
bits of the column parity.The receiver can knows that the
message is somewhat corrupted and discard the whole
message.
(c) Three bits are detected because they affect two parity bits ,one
of the column parity and the other of the row parity.The
receiver knows that the message corrupted and discards the
whole message.Although it can not show where the errors were
located.
(d) For this case the error can not be detected because non of the
parity bits are affected.
Question 6
Data provided;
Data word=101001111
Divisor=10111
Required;
To show generation of CRC at the sender using binary division.
Solution;
From data provide,
(n-k)+1=5
(n-k)=4
Now,
FCS=2(n-k)D
FCS=24(101001111)=1010011110000.
Then,
100110111
10111 ⟌1010011110000
10111
00111
00000
01111
00000
11111
10111
10001
10111
01100
00000
11000
10111
11110
10111
10010
10111
0101
Therefore,
The CRC code word is 101001111 0101.

Hence shown!.
Question 7
Solution;
(a) Yes,because the polynomial CRC-32 has satisfied condition for

one bit error detection which state that,for a generator
polynomial to detect single bit error it should have atleast one
term and the coefficient of x0 is not equal to zero.
(b) Yes,because the length of burst error is less than the length of
the generator polynomial CRC-32.
(c) From,
Probability=1-(0.5)r-1
Probability=1-(0.5)32-1
Probability=0.999999999
Therefore;
(d) From,
Probability=1-(0.5)r
Probability=1-(0.5)32
Therefore;
Question 8
Solution;
9×1=9
7×3=21
8×1= 8
0×3=0
0×1=0
7×3=21
2×1=2
9×3=27
6×1=6
7×3=21
7×1=7
5×3=15
Sum=137
Modulo 10 division;
13
10 ⟌137
100
37
30
7
Now,
Check digit=10-7
Check digit=3
Hence;
Check digit=3
Question 9
(a)
Data provided;
P(x)=x4+x+1
Data bits=10010011011
Required;
To encode the Data bits.
Solution;
Generator bits=10011
n-k=4
FCS=100100110110000
Now,
100110111
10011 ⟌100100110110000
10011
00010
00000
00101
00000
01011
10011
10110
10011
01011
00000
10111
10011
01000
10011
10000
10011
00110
00000
01100
00000
1100
Now,
A code word =10010011011 1100
(b) Received,
0001110110111100
Yes,error can be detected because the generator polynomial can not

Divide (x4+1),where 4 is the distance between the erroneous bits.
(c)Received,
00001110110111100
No,error can not be detected because the error pattern results to the
formation of odd number of error bits,and generator polynomial can
not be write in the form of (x+1) so as to detect odd number of
Errors.
Question 10
Solution;
Sum1=00000000+(A7A2)16
Sum2=(A7A2)16+(CABF)16=17261
Sum3=(903A)16+(17261)16=2029B
Sum4=(A123)16+(2029B)16=0002A3BE
Sum= Sum4=0002A3BE
Left sum=0002
Right sum=A3BE
Sum=0002+ A3BE
Sum=0000A3C0
Complement sum
Coplement(0000A3C0)=FFFF5C3F
Checksum= FFFF5C3F
Tuncate(Checksum)
Truncate(FFFF5C3F)=5C3F
Hence;
Checksum=(5C3F)16

Assignment 1 2

Uploaded by

Copyright:

Available Formats

Assignment 1 2

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Assignment 1 2

Uploaded by

Copyright:

Available Formats

KARUME INSTITUTE OF SCIENCE AND

EGU 07522 Networks and Data

To be Submitted to: Mr. Ali A. Abdulla,

Checksum at sender Checksum at receiver

The CRC code word is 101001111 0101.

(a) Yes,because the polynomial CRC-32 has satisfied condition for

A code word =10010011011 1100

Yes,error can be detected because the generator polynomial can not

You might also like

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.