MUHAMMAD AZHAR BIN AB RAZAK(2019181999)

ASSIGNMENT 1

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

a. 1001011

b. 0001100

c. 1000000

d. 1110111

e. 1010101

Data units Even Parity

1001 011 1001 0111
0001 100 0001 1001
1000 000 1000 0001
1110 111 1110 1111
1010 101 1010 1011

2. If the dataword is 1111 11, the divisor is 1010, what is the remainder? What is the

codeword at the receiver? Show your work.

110011

1010 √ 11111100 0

1010_ _ _ _

101 1

101 0 __ _

00 11

00 00_____

0 110

0 000_____

1100

1010____

110 0

101 0__
 _11 0 __=remainder ,codework received at receiver is 1111 1111 0.

3. If the data unit is 100100 and the divisor 1101, what is the dividend at the transmitter?

Show your work.

111101

1101 √ 10010000 0

1101_ _ _ _

100 0

110 1 __ _

10 10

1101_____

1 110

1 010_____

0110

0000____

110 0

110 1__

_00 1 __=remainder ,the dividend at transmitter is 1001 0000 0.

4. Suppose a sender sends a data unit of 110110111. If the system is using Cyclic

Redundancy Check (CRC) techniques with a divisor of 1100.

a. What is the dividend at the transmitter? Show your work.

b. What is the dividend at the receiver? Show your work.

c. If the receiver receives the bit pattern 110110111111, is there an error in the

data? Show your work.

1001 0010 1

1100 √ 1101 1011 1000

1100_ _ _ _

001 1

000 0 __ _

01 10

00 00_____

1 101

1 100_____

0011

0000____

011 1

000 0__

11 10

11 00 __

0 100

0 000___

1000

1100__

_ 100__=remainder

a) dividend at transmitter=1101 1011 1000

b) dividend at the receiver=1101 1011 1100
 c) yes, there is a transmission error in the data receives because the remainder at the data
received is not equal to zero.

5. Using the following codewords : 1100 1, 1001 1, 1111 1, 0100 1, 0010 0, 0101 0.

a. Find the Hamming distance. Show your work.

b. Find the minimum Hamming distance. Show your work.

a)

INPUT OUTPUT DISTANCE

1100 1 1001 1 0101 0 2
1100 1 1111 1 0011 0 2
1100 1 0100 1 1000 0 1
1100 1 0010 0 1110 1 4
1100 1 0101 0 1001 1 3

INPUT OUTPUT DISTANCE

1001 1 1111 1 0 110 0 2
1001 1 0100 1 1101 0 3
1001 1 0010 0 1011 1 4
1001 1 0101 0 1100 1 3

INPUT OUTPUT DISTANCE

1111 1 0100 1 1011 0 3
1111 1 0010 0 1101 1 4
1111 1 0101 0 1010 1 3

INPUT OUTPUT DISTANCE

0100 1 0010 0 0110 1 3
0100 1 0101 0 0001 1 2

INPUT OUTPUT DISTANCE

0010 0 0101 0 0111 0 3

b) minimum Hamming distance =1.

6. Given a bit stream of 1111111 0000001 1101000 0001111 encoded using ASCII. If Two

dimensional Even Parity Check is used, determine the parity bits. Identify the actual

data sent to the destination. Show your work.

1111 111 1
0000 001 1
1101 000 1 Parity bits
0001 111 0

0011 001 1
Parity Bits

Actual data sent = 11111111 00000011 11010001 00011110 00110011

7. Suppose a receiver receives the following pattern:

10110110 11100010 10111001 10101100 using a checksum of 8 bits. Determine if there

is an error in the data unit. State your reason.

1011 0110

+ 1110 0010

1 1001 1000

+ 1

1001 1001

+ 1011 1001

1 0101 0010

+ ___1

0101 0011

+ 1010 1100

1111 1111=there are no error, the outcome are found to be one, hence no error received.
8. Assume a packet is made only of four 16 bits word A7A2, CABF, 903A, and A123. Find

the checksum. Show your work.

A7A2

+ CABF

1 7261

+ 1

7262

+ 903A

1 0290

+ 1

029D

+ A123

A3CO=SUM

FROM SUM,WE CAN FIND THE CHECKSUM WHICH IS 5C4B.

9. A receiver received these data which are 3456, ABCC, 02BC, EEEE, 2E32. Check if

there is an error or not. Show your work.

3456

+ ABCC

E022

+ 02BC

E2DE

+ EEEE

1D1CC

+ 1

DICD=SUM

2E32=CHECKSUM

DICD

+ 2E32

FFFF=THERE IS NO ERROR SINCE THE RESULT IS EQUAL TO FFFF.

10. The receiver received the following codewords: 10011 01010 11100 01111 10000. Using

Hamming code error detection mechanism, find the datawords and check if there is an

error or not. Table below is given.

Datawords Codewords

00 00000
01 11100
10 10011
11 01111
Hamming Distance Table

INPUT OUTPUT DISTANCE

10111 01010 11101 4
10111 11100 01011 3
10111 01111 11000 2
10111 10000 00111 3
01010 11100 10110 3
01010 01111 00101 2
01010 10000 11010 3
11100 01111 10011 3
11100 10000 01100 2
01111 10000 11111 5

D min,Minimun distance =2

D min=S+1,

S= 2-1,

S=1,

this code can detect up to single error.

In this case,there is an error because the output doesn’t match with the codework.