Scribd
Upload
31 views

The University of The South Pacific: Wireless Communications & Networks Homework 5 Date: June 2018 Dr. M. Assaf

The document contains a homework assignment on wireless communications and networks from the University of the South Pacific. It includes 5 problems: (1) calculating the number of possible code words and valid code words for a blocking code with k=3 bits and n=5, (2) finding the hamming distances between 4 binary sequences, (3) finding the frame check sequence used for a given bit stream and coding sequence, (4) plotting an 8-level PCM scheme for a given data stream, and (5) obtaining a new data stream by sampling the PCM scheme and calculating a new frame check sequence using a given polynomial.

Uploaded by

Reece
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
31 views

The University of The South Pacific: Wireless Communications & Networks Homework 5 Date: June 2018 Dr. M. Assaf

The document contains a homework assignment on wireless communications and networks from the University of the South Pacific. It includes 5 problems: (1) calculating the number of possible code words and valid code words for a blocking code with k=3 bits and n=5, (2) finding the hamming distances between 4 binary sequences, (3) finding the frame check sequence used for a given bit stream and coding sequence, (4) plotting an 8-level PCM scheme for a given data stream, and (5) obtaining a new data stream by sampling the PCM scheme and calculating a new frame check sequence using a given polynomial.

Uploaded by

Reece
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/ 4

The University of the South Pacific

WIRELESS COMMUNICATIONS & NETWORKS

HOMEWORK 5 Date: June 2018 Dr. M. Assaf

Problem 1
Consider a communication system using blocking code. If we wish to transmit blocks of
data of length k = 3 bits and with n = 5.

a) Find the number of possible code words.

b) How many valid code words are there?

Problem 2
For the following binary sequences, d1, d2, d3, d4:

d1 = 010110
d2 = 001101
d3 = 101111
d4 = 000110

a) Calculate the hamming distances Vd1,d2; Vd1,d3; Vd1,d4; Vd2,d3; Vd2,d4;


Vd3,d4.
b) The following bit stream 0011 0111 1110 0001 0010 1100, contains data and
FCS. Find the FCS used if the sequence used for coding it was: 1000111.

c) Plot the data using an 8-level PCM scheme with a sampling interval of 1msec and
a voltage equivalent of 2 volts per level. (locate your first sample at t=0ms and in
the middle of the voltage point in the relevant range).
d) Obtain a new data stream from the previous graph (part c) by observing 7 samples
at a sampling rate of 0.5 ms (first sample should start where the signal starts – if a
sample is in the middle of two levels, take the lower level).
e) Find a new FCS for the data obtained in the previous problem using P=100101.

You might also like