COMUNICACIONES DIGITALES MODERNAS

DEBER 2

1) Problem 9, chapter 6, Goldsmith: Consider a communication system which uses BPSK signaling with average
signal power of 100 Watts and the noise power at the receiver is 4 Watts. Can this system be used for data
transmission? Can it be used for voice? Now consider there is fading with an average SNR per bit of 20 dB. How
does your answer to the above question change?

2) Problem 17, chapter 6, Goldsmith: Consider a cellular system with circular cells with radius equal to 100
meters. Assume propagation follows the simplified path loss model with K = 1, d 0 = 1m, and (SNR)γ = 3.
Assume the signal experiences log-normal shadowing on top of path loss with σψdB = 4 as well as Rayleigh
fading. The transmit power at the base station is Pt = 100 mW, the system bandwidth is B = 30 KHz, and the
noise PSD is N0 = 10−14 W/Hz. Assuming BPSK modulation, we want to find the cell coverage area (percentage
of locations in the cell), where users have average Pb less than 10−3.
a) Find the received power due to path loss at the cell boundary.
b) Find the minimum average received power (due to path loss and shadowing) such that with Rayleigh fading
about this average, a BPSK modulated signal with this average received power at a given cell location has
Pb < 10−4.
c) Given the propagation model for this system (simplified path loss, shadowing, and Rayleigh fading), find
the percentage of locations in the cell where under BPSK modulation, P b < 10−4.

3) In indoor channels 𝜎𝑇𝑚 ≈ 50 ns whereas in outdoor microcells 𝜎𝑇𝑚 ≈ 30µs. Find the maximum symbol rate
𝑅𝑠 = 1/𝑇𝑠 for these environments such that a linearly modulated signal transmitted through these environments
experiences negligible ISI.

4) For a channel with Doppler spread 𝐵𝑑 = 80 Hz, what time separation is required in samples of the received signal
such that the samples are approximately independent.

5) Consider a (7,4) code with generator matrix

0101100
1010100
G= 0110010
1100001

(a) Find all the codewords of the code.

(b) What is the minimum distance of the code?
(c) Find the parity check matrix of the code.
(d) Find the syndrome for the received vector R = [1101011].
(e) Assuming an information bit sequence of all 0s, find all minimum weight error patterns e that result in a
valid codeword that is not the all zero codeword.
(f) Use row and column operations to reduce to systematic form and find its corresponding parity check
matrix.

6) Compare the following linear block codes in terms of rate, coding gain, and error correction capability (for hard
decoding):
1. Code type I: Hamming code with N=15 coded bits per codeword, q=11 information bits per codeword, free
distance (min Hamming distance) d=3
 2. Code type II: BCH code with N=133, q=101, d=3
3. Code type III: Parity bit coding with N=8, d=2

7) Consider the convolutional code generated by the encoder shown in the Figure.
(a) Indicate the rate of the code
(b) Sketch the trellis diagram of the code.
(c) Compute the sequence of coded bits corresponding to the input bit sequence
1 0 1 1 0 1. Initial state of the encoder is 00.
(d) Compute the free distance of the code