Professional Documents
Culture Documents
PART II Wireless Channels and Techniques 1- Mobile Wireless Channels 2- OFDM 3- Performance Measures 4- Diversity Techniques
Introduction
Before we start the detailed analysis of RRM algorithms we need to introduce the main concepts of mobile channels. This is very important topic to see the effects of channels on transmitted signals. We need also to introduce the performance measure tools. This is important because it gives the possibility to evaluate the received signals if it is excellent, good, poor, very poor, ..etc. The above two topics will be covered in this lecture.
Example
Study the effect of multipath environment by assuming the transmission of 1.8GHz of unmodulated carrier. Assume only two paths, one path has fixed delay and the other path has random delay. Plot the received signal power (in dB scale) using Matlab if the random delay has uniform distribution in the interval [0,1] s. Solution: Name the two paths signals as x1(t) and x2(t), and the received signal y(t)= x1(t) + x2(t), Also let the received amplitude is fixed (usually it is also random). Assume the received amplitude of the first path is 1 volt and the second path is 0.9 volt.
x1 ( t ) = A1 cos ( 2 f 0 [t 0 ]) = A1 cos ( 2 f 0t 2 f 0 0 ) = A1 cos ( 2 f 0t 0 ) x2 ( t ) = A2 cos 2 f 0 t 2 ( t ) = A2 cos ( 2 f 0t 2 f 0 2 ( t ) ) y ( t ) = x1 ( t ) + x2 ( t ) = cos ( 2 f 0t 0 ) + 0.9 cos ( 2 f 0t 2 f 0 2 ( t ) ) let 0 = 0 y ( t ) = 1.81 + 1.8cos ( 2 f 0 2 ( t ) ) cos ( 2 f 0t + n ) From previous equation we see that the amplitude is random and depends
Radio Resource Management
Example
4 2
It is clear the large fluctations of the received power because of the second random delay path
Power dB w
-2
-4
-6
-8
-10 time
Example
The Matlab Code: f0=1.8e9; % carrier frequency tao=1e-6*rand(200,1); %generation of 200 random delay Pr=(2+1.8*cos(2*pi*f0*tao))/2; % instantaneous power Pr_db=10*log10(Pr); % expressing the power in dBw plot(Pr_db) %plot the power
FF: Flat Fading FSF: Frequency selective fading FaF: Fast Fading SF: Slow Fading FT: Fourier Transform
5 spreading of
the signal
7
FT
10
Time Domain description
13
FT
16
FSF 8
FF 9
FSF 11
FF 12 14 FaF SF 15
17
18 FaF SF
9
10
Pr _ dB = P _ dB 10n log10 ( d ) + ( dB ) t
Where denotes a zero mean, Gaussian random variable (in decibels) with standard deviation (also in decibels). is site and distance dependent. The variance 2 can be between 5 up to 8 dB or even more.
12
For mobile radio applications, the channel is time-variant because motion between the transmitter and receiver results in propagation path changes.
Radio Resource Management Mohammed Elmusrati Vaasa University 13
14
15
Lin
f eo
Sig
ht
scattering
Diffraction
16
Multipath Scenario
Multipath causes two different kinds of problems
Fading (due to the phase differences) in the band pass, i.e., before demodulation Inter-Symbol-Interference (ISI) in the baseband domain
17
t1+
t2+
When d 1/BW then we have large time spreading in the received signal which can > lead to considerable signal distortion. BW is the signal bandwidth.
Radio Resource Management Mohammed Elmusrati Vaasa University 18
s (t ) = Re g (t ) e j 2 fct
g (t ) = g (t ) e j (t ) = R (t ) e j (t ) Where R(t) is the envelop magnitude, and (t) is its phase. For phase- or frequency modulation, R(t) is almost constant.
19
r (t ) = n (t ) s (t n (t ))
n =1
Where n(t) is the gain of path n at time t, m is the number of paths, and s(t) is the transmitted signal. Usually it is easier to work with base band signal, then substitute for s(t) (see the previous slide)
Radio Resource Management Mohammed Elmusrati Vaasa University 20
10
()
() (
( ))
()
( ))
The above relation is the discrete convolution between the transmitted signal and the channel impulse response.
21
22
11
xn ( t ) + jyn ( t ) = n (t ) e jn (t )
If the number of such stochastic components is large, then the orthogonal components will be random variables with Gaussian distribution.
Radio Resource Management Mohammed Elmusrati Vaasa University 23
r0 (t ) = xr2 (t ) + yr2 (t ) , xr (t ) = xn (t ), yr (t ) = yn (t )
n n
In case of non dominant component (i.e. no line-of-sight component or in other words xr and yr are zero mean Gaussian distribution), it is not difficult to prove that r0(t) has Rayleigh distribution such as r0 r02 2 exp 2 for r0 0 2 is the predetection mean f ( r0 ) = 2 power of the multi-path signal otherwise 0
Radio Resource Management Mohammed Elmusrati Vaasa University 24
12
25
200
300
400
700
800
900
1000
26
13
27
Tm
14
29
= E 2 ( E [ ])
Radio Resource Management
30
15
1 5
31
32
16
spectral density
f0
frequenct
33
spectral density
f0
frequency
34
17
35
18
R ( t ) = J 0 ( kV t )
Where J 0 (.) the zero-order Bessel function of the first kind, is Vt is distance traveled, and k=2/ is the free-space phase constant (transforming distance to radians of phase). It has been shown experimentally that the received signals are statistically uncorrelated if distance between the receiving antennas is just 0.4 !
Radio Resource Management Mohammed Elmusrati Vaasa University 37
19
1 2 v f c S ( v ) = f d 1 f d 0
Radio Resource Management
fd + fc v f d + fc
else where
39
20
T0 =
Radio Resource Management
9 16 f d
41
W < fd
or
Ts > T0
Otherwise the channel is slow fading. From previously, one can see that from signal dispersion point of view, the coherence bandwidth f0 sets up upper limit on the signalling rate (or bandwidth) that can be used without suffering frequency-selective distortion, and from Doppler spreading the channel fading rate fd sets a lower limit on the signalling rate that can be used without suffering a fast fading distortion.
42
21
43
h ( t , ) = k ( t ) e j 2 fdk t ( t k ),
k =1
( t ) = k ( t )e j ; k ( t ) =
k
d
n k
(t )
Where k is the absolute channel gain for path k, fdk is the Doppler frequency for path k, k is the phase offset for path k, is random number with lognormal distribution, and dk(t) is the distance of the path k between transmitter and receiver at time t.
Radio Resource Management Mohammed Elmusrati Vaasa University 44
22
r ( t ) = s ( t ) h (t , ) = k (t ) e j 2 f dk t s (t k ),
k =1
If the symbol duration greater than the maximum delay difference (Flat Fading) then the above equation can be simplified as
r ( t ) = s (t 0 ) k (t ) e j 2 f dk t = b (t ) s (t 0 ) ; where b (t ) = k (t ) e j 2 f dk t
k =1 k =1
In this case the channel can be represented by a multiplicative operation (with a complex number) rather than convolution.
Radio Resource Management Mohammed Elmusrati Vaasa University 45
Mitigating ISI
In many situations the problem of ISI is more stringent than the problem of the additive noise. The limitations of noise can be mitigated through several ways such as increasing the transmission power, improving the front-end receiver amplifier, using channel coding, higher antenna gains, and so on. However, the problem of ISI cannot be mitigated by just increasing the transmission power or improving the SNR. It can be mitigated by using equalizers which reduce the ISI problem. High quality equalizers which can work at high data rate are very complex. Moreover, equalizers need training sequence to be transmitted periodically to track channel variations. This reduces overall system capacity and efficiency. There is another way to mitigate the ISI by using CDMA, where the autocorrelation is very small. Therefore, when a copy of the transmitted code arrives after a certain delay (> chip duration), it will have very small contribution because of low correlation. Moreover, it can enhance the communication quality with Rake receiver (exploit the time diversity behavior). In wireless channels if the delay spread of the channel is 1 ms, then the symbol rate will be limited to be less than 1 kSymbol/s!! Using equalizers this can be relaxed to few kSymbols/ s, but still not enough for high data rate. One clever way to mitigate the ISI problem for high data rate systems is using Orthogonal Frequency Division Multiplexing (OFDM).
46
23
47
ISI Limitations
To understand the main concept of OFDM, lets take this simple example. Example: For certain wireless channel, the significant delay spread is 0.1 ms, find the symbol rate (roughly) in order to have free ISI reception without using equalizers. If it is possible to have 1024 parallel orthogonal transmission simultaneously, what is the achievable symbol rate in this case (without equalizers). Solution In the first case, the symbol rate should be around 5 kSymbol/s. In the second case, now we have 1024 parallel orthogonal transmission, where every branch may send at 5 kSymbol/s, i.e., the total symbol rate becomes: 5.12 MSymbol/s
48
24
ISI Limitations
From previous we conclude that: Wide bandwidth signals (i.e., signal with high data rate), will suffer from the ISI problem according to the channel dispersion. One very effective way to solve this problem is to divide this high bandwidth to many smaller bandwidth signals and send every one over orthogonal carriers. One intuitive way to do that is by reducing the transmitted data rate through serial to parallel converter and then using sinusoidal carriers to transmit the parallel resultant signal. Next slide shows simple realization of the multi-carrier (MC) transmission for three channels.
Radio Resource Management Mohammed Elmusrati Vaasa University 49
MC-FDMA Realization
s1 (t ) a0a3
fs Multiplier (Mixer)
MF=Matched Filter
MF
a0a1a2a3a4a5
Rate=3fs
Channel
s (t )
cos ( 2 f 1t + 1 )
sum
cos ( 2 f 1t + 1 )
s 2 (t ) a1a4
fs
cos ( 2 f 2t + 2 )
x (t )
y (t )
MF
P/S
cos ( 2 f 2t + 2 )
s 3 (t ) a2a5
fs
cos ( 2 f 3t + 3 )
Radio Resource Management
MF
cos ( 2 f 3t + 3 )
50
25
MC-FDMA Realization
What is the minimum frequency separation between sine waves to guarantee orthogonality between different channels so that it would be easy to demodulate them without interfere each other? Lets assume that the symbol duration after serial to parallel encoder is Ts seconds (it means that the symbol duration was Ts/3 before S/P encoder, or generally Ts/N if we use N parallel channels). The frequency separations must satisfies the following condition:
T 0, i k 1 s cos ( 2 f i t + i ) cos ( 2 f k t + k ) dt = Ts A 0, i = k 0 When A=1, it is called orthonormal.
51
MC-FDMA Realization
To find the separation condition necessary for orthogonality,
1 Ts
Ts
cos ( 2 f
0 Ts 0
t + i ) cos ( 2 f k t + k ) dt =
1 2T s
cos ( 2 ( f
26
MC-FDMA Realization
If the original (broadband) signal s(t) has bandwidth Bt as shown in figure, then after dividing to the total band into three sub-bands we will have the following system
S (f
3f s 2 2 S 1 (f )
S/P
S 2 (f
3f s 2
S 3 (f
fs 2
fs 2
fs
2f s 5f s
2
fs 2
fs 2
fs 2
fs 2
fs 2
fs 2
The required bandwidth with using this technique is higher than the original bandwidth
53
MC-FDMA Realization
If we applied this technique in practice we would need even higher bandwidth, because we should keep guard band between different signals bands to handle any frequency changes according to channel or local oscillator drifts. And also because the bands are not perfectly limited (otherwise it would need time duration)! This is shown below. This explains why the idea of multi-carrier parallel transmission was not applied before. It considerably reduce the spectrum efficiency.
54
27
OFDM
When VLSI implementation of DSPs becomes very efficient and at reasonable price, it becomes possible to handle the multicarrier orthogonality by using Fast Fourier Transform (FFT) and its spouse Inverse Fast Fourier Transform (IFFT). Because the modulation process is done jointly with IFFT, we may not consider the phase shifts. In this case the minimum shift between carriers to handle the f 1 = ,s hence, the spectrum can be orthogonality becomes: 2T s 2 greatly reduced (it will be same as the original spectrum as shown in the figure below) Prove this result using slide 52. Now we do not have spectrum loss.
3f s 2
3f s 2
55
S/P Encoder
P/S
Information via feedback channel (e.g., received SNR per sub-channel) Radio Resource Management
RF
56
28
57
58
29
X ( N 1)
IFFT
Note that e j 2 mk N is discrete representation of the complex sinusoidal signal. The orthogonality concept is applied here, i.e.,
N 1 k =0
x ( N 1)
j 2 mk N
e j 2 bk
= e
k =0
N 1
j 2 ( m b ) k N
m =b 1, = ( m b ) = 0, elsewhere
59
x 0 = X m , x 1 = X m e j2 m N ,
()
N 1
m=0
( ) ()
N 1
m=0
( )
In the receiver, it is possible to retrieve the original signal again by using FFT operation as explained in the next slide.
Radio Resource Management Mohammed Elmusrati Vaasa University 60
30
()
1 N
x (k ) e
k=0 N 1 N 1 m=0 k=0 N 1
N 1
j2 bk N
=
(
1 N
)
$ X ( m ) e
k=0 m=0
N 1 N 1
" #
j2 mk N
% j2 bk 'e &
( )
= ,
1 N
X ( m) e
k=0 m=0
N 1 N 1
j2 mb k N
Z b =
()
1 N
X ( m) e e
( )
j2 mb k N
1 N
X ( m) e
m=0 k=0
N 1
N 1
j2 mb k N
j2 mb k N
= mb Z b =
()
()
()
61
S/P Encoder
IFF T
P/S Decoder
62
31
Cyclic Prefix
The principle of cyclic prefix is to extend the transmitted signal beyond the nominal symbol period into a guard interval, so as to provide a cyclic signal. The receiver correlator, however, only integrate over the nominal symbol period. Thus any signals delayed by channel dispersion remain orthogonal, eliminating both ISI and ICI provided the delay is less than the guard interval. The guard interval is therefore always implemented in OFDM systems operating on a dispersive channels.
Tg T Correlator window
64
32
Cyclic Prefix
Cyclic prefix is a crucial feature of OFDM used to combat the intersymbol-interference (ISI) and inter-channel-interference (ICI) introduced by the multi-path channel through which the signal is propagated. The basic idea is to replicate part of the OFDM time-domain waveform from the back to the front to create a guard period. The duration of the guard period Tg should be longer than the delay spread of the target multi-path environment
Note that, the prefix duration is added to prevent ISI. Adding part of original symbol in this prefix duration will maintain the orthogonality between subchannels so that we mitigate inter channel interference (ICI).
Radio Resource Management
prefix
Tg
T
65
33
S/P
Baseband
Demodulation + Equalization + Subband channel estimation
P/S
Bit stream
Channel state information sent through feedback channel Radio Resource Management Mohammed Elmusrati Vaasa University 67
Interleaving
The impulsive noise or the deep fading problem may cause packet loss, where most of the packet bits arrive in error, or sometimes, the packet could not be decoded. One solution to mitigate this problem is to distribute the packet bits over several subchannels. For example if each packet consists of 8 bits. And we have 8 subchannels so that we send one bit from each packet over one subchannel. If one subchannel lost because of fading or noise, then we loss only one bit from each packet. The FEC will be able to correct this bit in each packet. This technique will give some kind of diversity. Next slide shows simple realization of the interleaving with OFDM
Radio Resource Management Mohammed Elmusrati Vaasa University 68
34
Interleaving - Deinterleaving
Bin Bout
S/P Encoder Multicarrier orthogonal modulation using IFFT
deinterleaving
b2 b7 bC b3 b8 bD
Interleaving
Bout
Bin
Bin=b0b1b2b3b4b5b6b7b8b9bAbBbCbDbEbF b0 b1 b2 b3 b5 b6 b7 b8 bA bB bC bD
Bout=b0b5bAb1b6bBb2b7bCb3b8bDb4b9bE b0 b1 b6 bB b4 b9 bE B5 bA
Bout=b0b5bAb1b6bBb2b7bCb3b8bDb4b9bE
Bin=b0b1b2b3b4b5b6b7b8b9bAbBbCbDbEbF
Mohammed Elmusrati Vaasa University 69
70
35
71
36
Real time data streams Audio samples Video frames Sensor inputs Actuator commands Non-real time data streams Internet exploring File DOWN/UP-loads
Radio Resource Management Mohammed Elmusrati Vaasa University 73
Audio Streams
The un-coded data rate depends on the sound quality. Telephone quality needs (with PCM) 64 Kbit/s CD quality needs 1.4 Mb/s (two-channel-stereo stream) The compression methods can dramatically reduce the required data rate at small degradation in the quality Recommended maximum delay for real time audio streams is 32 ms In mobile communication, some audio compression methods are used to reduce the required bandwidth without much of scarifying the voice quality. Usually the Linear Predictive Code (LPC) is used for this purpose. With LPC the required bit rate for voice is reduced from 64 Kb/s to only 13 Kb/s!
74
37
Throughput
The throughput of a stream defines the amount of user data transferred in a certain time unit between source and sink. Because of possible errors during the transmission there is possibility of retransmission requirement will reduce the actual throughput. Furthermore, the data do not contain only payload data but also other data like coding bits. This is also reduce the throughput. Generally throughput data rate [data]=[Address ; Payload ; Coding Bits ; ..] Throughput Data Rate Some applications need high throughput such as video transmission, high quality sound, and download of large files. Speech signals and text email transmission are examples of low throughput applications.
75
Delay
Transferring data packets between stream source and sink consumes time spent for processing, and queuing in the nodes and for transmission in the network. An upper bound on the delay Dmax denotes the maximum time any packet of a stream will need to be transferred. For real time applications the maximum allowed delay is restricted. More relaxed delay is allowed for non-real time applications. The allowed delay of packets determine the priority of transmission.
76
38
Jitter
Data packets of the same stream may experience different transfer delays. The delay variation is usually called jitter. Jitter can be represented as the difference between the maximum delay and the minimum delay of the packets. The problem of jitter may cause the packets do not arrive in the correct order. For example if the delay of the first packet is much more than the delay of the second one, this may cause the second packet to arrive first! This problem can be solved by numbering the packets, however, this has other problem such as reducing the efficiency and increasing the system complexity.
Radio Resource Management Mohammed Elmusrati Vaasa University 77
39
BER = f ( E b N 0 )
Where f(.) is the mapping between the BER and the SINR. This mapping depends on:
Modulation type (FSK, PSK, 8PSK, 16QAM,..etc.) Channel type (additive noise, interference structure,..) Fading type (flat fading, frequency selective channel, ..etc)
For simple additive noise channel and BPSK modulation the relation is given by
where
x0
79
10
-1
10
-2
10
-3
10
-4
10
-5
10
-6
10
-7
-10
80
40
81
PB = g ( ) f ( ) d
0
Where g() is the instantaneous mapping between SNR and the BER
82
41
Packet Loss
Packets may be lost due to congestions, deep fading, impulsive noises, buffer overflow, hardware errors etc. The probability of packet loss is one of the QoS parameters in communication systems.
83
Diversity Techniques
The problem of fading is very serious in wireless communication systems. There is always probability for the signal amplitude to be less than the minimum required to detect it. This causes loss of packets. There are some solutions to mitigate this problems (it is not possible to avoid it 100%). Some solution are expensive and difficult and some others are much cheaper and easier. Some of the expensive solution is to use very high sophisticated equalizers to mitigate the ISI problem, joint equalizers and smart antennas, Rake receivers, MIMO systems,.. The most common simple solution is to use diversity. The diversity can be utilized on different dimensions such as frequency, time, spatial, polarization, ..etc.
84
42
Diversity Techniques
The frequency diversity is utilized by sending the information with different carriers. The separation between carriers should be enough to experience independent (or at least uncorrelated) channels. If the probability of one carrier to be faded is p then the probability of two distinct carriers to be faded in the same time is p2. The frequency diversity is used for example in GSM where they use slow frequency hopping (217 hops/s) to compensate for those cases where the mobile unit is moving very slowly (or not at all) and experiencing deep fading.
85
Diversity Techniques
Time Diversity: can be provided by transmitting the signal on L different time slots separation of at least T0 (see slide# 28). Interleaving, when used along with error-correction coding is a form of time diversity. Spatial diversity is one simple and efficient solution for fading problems. It is based on simple idea is to use more than one antenna to receive the signal. The antennas should be separated enough to be at least uncorrelated channels (for example 10 wavelengths). It is possible to combine the signals from different antennas by different techniques. The simplest way is by just add all signals together. Another method by selecting the best antenna and use its signal for decoding. Best performance is obtained by coherently adding all branches signals together. Several other combining algorithms were discussed in Digital Communication course.
Radio Resource Management Mohammed Elmusrati Vaasa University 86
43
Diversity Analysis
From slide 82 we presented that the average BER over fading channel is given by
PB = g ( ) f ( ) d
0
Where =Eb/No. Since the received magnitude has a Rayleigh distribution then will have exponential distribution such as
f () = 1 exp , where = E [ ]
87
Diversity Analysis
If each diversity (signal) branch, i=1,2,,M, has an instantaneous Eb/No= i and we assume that each branch has the same average Eb/No, then
f ( i ) = 1 exp i , where = E [i ]i = 1,.., M
The probability that a single branch has Eb/No to be less than some threshold t is
t t
Pr ( i t ) =
f ( i )d i =
exp d
0
t = 1 exp
88
44
Diversity Analysis
The probability that all M independent signal diversity branches are received simultaneously with an Eb/No less than some threshold value t is
t Pr ( 1 t , 2 t ,L , M t ) = 1 exp
M
Example: For certain mobile communication system the channel can be expressed as Rayleigh channel with an average Eb/No =5 dB. The packet will be lost if the received Eb/No < 4 dB. Find the probability of packet lost if using single antenna then if using 4 antennas with large separation.
89
Diversity Analysis
Solution
tdB = 4dB t = 100.4 = 2.51 = 5dB = 100.5 = 3.16 2.51 Pr i t = 1 exp = 0.54! 3.16 The probability of successful reception is only: 1-0.54=0.46
90
45