Numerical Transmission Systems

Master CSE, January , 2009.

PLEASE WRITE PART I AND PART II ON A SEPARATE SHEET

Part I [10 points]: Carrier frequency Modulation

We consider a transmission such that r(t) = x(t) + n(t) where n(t) is a real Additive White Gaussian Noise (AWGN) with bilateral PSD N0 /2 (where N0 = 4.1021 Watt/Hz), x(t) is a linearly digitally carrier modulated signal with mean power Px = 1 Watt, and = 4.106 is an amplitude attenuation. The carrier frequency is f0 = 1 GHz , the bit rate is 100 M bit/sec ( iid bits),

1.1

Choice of a modulation

From the optimum performance curves (course documents) and without coding :
Eb in entrance of the receiver (in dB and linear scale), for a a- Give the required (approximate) N 0 10 binary error probability P e < 10 with BPSK, QPSK, 16-QAM , 64-QAM.

b- Is it possible to transmit a BitRate 100 Mbit/s with Error Probability P e < 1010 by these modulations ? For each possible case, give then the required minimal bandwidth (around the carrier). We assume in the following that x(t) = Re{x (t) ej (2f0 t) }, with
m=+

x (t) = A.Ts .
m=0

a [m] .he (t mTs )

The symbol pulse he is a rectangular pulse which lasts Ts /4, such that Ts .he ( ) = Rect[0,Ts /4[ ( ). We take a BPSK modulation such that a {1; +1}. c- Express A versus Px ?

1.2

Receiver parameters

After I/Q-demodulation, the decision variable y [k ] = y (tk ) is obtained by ltering (with I.R. lter hr (t) = he(t + t0 )) and sampling at tk = t0 + k.Ts , where t0 is parametrizable. Then, symbol decisions are taken by threshold. a- Give and explain the parameters (especially the value chosen for t0 ) of each block of the receiver Eb in order to obtain the lower Error Probability. In this case, give the relationship between P e and N . 0 b- Give the expression and shape ( sec , Volts) of the receive lter analog output y (t) for the bits sequence 0, 1, 0, 0, 1, 0, 1, 1, . . . to be transmitted from t = 0.

1.3

Impact of a multi-path channel

A secondary propagation path appears with a propagation delay . The model of the receive signal 6 becomes : r(t) = 1 .x(t) + 2 .x(t ) + n(t), with = Ts /2, 1 = = 4.10 , and 2 = 1 . 22 . 1

a- Give the new relationship between the Energy per bit (Eb ) of the signal (without noise) in entrance of the receiver, and the transmit power Px . With the same receiver as previously : b- Express the receive lter output y (t) as a function of the symbols a [m] , and give its shape ( sec , Volts) for the bits sequence 0, 1, 0, 0, 1, 0, 1, 1, . . . to be transmitted from t = 0. c- Is the performance (Error Probability Pe) changed due to the secondary path, for a given transmit Eb . power Px ? Justify. Give also the new relationship between P e and N 0 With possible changes in the receiver : t) as before, is it possible to obtain a better decision thanks d- From the same analog lter output y ( to a new process than in c- (one point /symbol sampling and threshold)? If yes, give this best process Eb and the related relationship between P e and N . 0 e- From the receive signal r(t), is it possible to obtain a better decision than in c- by changing only the receive lter hr (t) and delay t0 ? Give then the new elements, the shape of the overall waveform Eb p(t) = he (t) hBB (t) hr (t) (where hBB is the baseband channel), and the relationship between P e and N . 0 f- Give a conclusion about the potential benet or degradation due to the multipath eect in this specic scenario.

PLEASE WRITE PART II ON A SEPARATE SHEET

2
2.1

Part II [10 points]: Viterbi, OFDM, CDMA

Viterbi.

Cj 1
"!#!!$

Ij 1

Ij,1

Ij 1,1

Ij 2,1

!! "%#%%$ %! "%#!!$ "!#!%$ "%#%!$ "!#%%$ !%

"%#!%$

Cj 2
!

"!#%!$ %%

Figure 1: Convolutionnal code. We use the code dened by gures 1 and 2. 2

Figure 2: Finite State Machine.

1. The initial coder state is 00. Encode sequence 001 using this code (warning, do not forget to reset the coder state) 2. After transmission over a Binary Symmetric Channel, the sequence 00 10 11 01 11 is received. Plot the lattice diagram to explain the behavior of the Viterbi algorithm and give the maximum likelihood estimate of the transmitted sequence.

2.2

Single carrier transmission

Problems (a) Inter Symbol Interferences. (b) Additive noise. (c) Doppler eect. (d) Time selective channel. Solutions (a) Error correcting codes (b) Source coding. (c) Equalization. (d) Phase Locked Loop. (e) Diversity.

1. What solutions for the following problems :

2. We assume a transmission channel is linear and has a nite causal and stable impulse response. What can we say about the stability and causality of its inverse ? 3. For a very large SNR at the channel output, how can we equalize the channel H (z ) = 3 + 2z 1 using a linear equalizer? What are the structure(s) that can be used to implement exactly or approximately this solution?

2.3

Automatic Gain Control and phase estimation.

At receiver, the signal is yk = Gk ak + nk . Symbols ak are independent identically distributed binaryvalued (1, +1 with probability 1/2) random variables (BPSK signal), nk is a circular white Gaussian noise, Gk is a slowly varying complex amplitude. 1. When the sequence {ak }kZ is known at the receiver, could you propose an adaptive algorithm to track the amplitude and the phase of Gk ? 2. If the phase varies more rapidly than the amplitude, can you adapt your algorithm? 3. Can you provide an algorithm for the blind case (symbols ak unknown at the receiver)?