You are on page 1of 12

# ECE 361: Fundamentals of Digital Communications

Lecture 22: Time Diversity

Introduction
We have seen that the communication (even with coding) over a slow fading flat wireless
channel has very poor reliability. This is because there is a significant probability that the
channel is in outage and this event dominates the total error event (which also include the
effect of additive noise). The key to improving the reliability of reception (and this is really
required for wireless systems to work as desired in practice) is to reduce the chance that the
channel is in outage. This is done by communicating over “different” channels and the name
of the game is to harness the diversity available in the wireless channel. There are three
main types: temporal, frequency and antennas. We will see each one over separate lectures,
starting time diversity.

Time Diversity Channel
The temporal diversity occurs in a wireless channel due to mobility. The idea is to code and
communicate over the order of time over which the channel changes (called the coherence
time). This means that we need enough delay tolerance by the data being communicated.
A simple single-tap model that captures time diversity is the following:

yℓ = hℓ xℓ + wℓ , ℓ = 1, . . . , L. (1)

Here the index ℓ represents a single time sample over different coherence time intervals. By
interleaving across different coherence time intervals, we can get to the time diversity channel
in Equation (1). A good statistical model for the channel coefficients h1 , . . . , hL is that they
are all independent and identically distributed. Further more, in a environment with lots of
multipath we can suppose that they are complex Gaussian random variables (the so-called

A Single Bit Over a Time Diversity Channel
For ease of notation, we start out with L = 2 and just a single bit to transmit. The simplest
way to do this is to repeat the same symbol: i.e., we set

x1 = x2 = x ± E. (2)

1

it is quite clear that the receiver might as well take the appropriate weighted linear combination to generate a single real voltage and then make the decision with respect to the single transmit voltage x.e. we suppose coherent reception. (13) 2 . (3) ℑ [y1 ] = ℑ [h1 ] x + ℑ [w1 ] . (11) and zero.. i.At the receiver. averaged over the statistics of the two channels h1 . ¢ Var(w) ˜ = (10) 2 The decision rule is now simply the nearest neighbor rule: √ decide x = + E if y MF > 0. By now. This is the matched filter operation: y MF = ℜ [y1 ] ℜ [h1 ] + ℑ [y1 ] ℑ [h1 ] + ℜ [y2 ] ℜ [h2 ] + ℑ [y2 ] ℑ [h2 ] . the receiver has full knowledge of the exact channel coefficients h1 . (7) Using the complex number notation. (5) ℑ [y2 ] = ℑ [h2 ] x + ℑ [w2 ] . (8) = |h1 |2 + |h2 |2 x + w. Probability of Error The dynamic error probability is now readily calculated (since the channel – cf. (4) ℜ [y2 ] = ℜ [h2 ] x + ℜ [w2 ] . but they get scaled by the real and imaginary parts of h1 and h2 . (12) √σ |h 1 |2 + |h |2 2 2 From the transmitter’s perspective. we have four (real) voltages: ℜ [y1 ] = ℜ [h1 ] x + ℜ [w1 ] . h2 : h ³p ´i Pe = E Q 2 2 2SNR (|h1 | + |h2 | ) . y MF = ℜ [h∗1 y1 ] + ℜ [h∗2 y2 ] . Therefore w˜ is zero mean and has variance: σ2 ¡ |h1 |2 + |h2 |2 . it makes sense to calculate the average error probability. Equation (9) – is now of an AWGN type):  2 2 √  (|h1 | + |h2 | ) E  Pedynamic = Q  ³p ´ . h2 . ¡ ¢ ˜ (9) Here w˜ is a real Gaussian random variable because it is the sum of four independent and identically distributed Gaussians. (6) As usual. otherwise.

e. Generalization We have worked with L = 2 for simplicity. (18) 8A2 SNR2 Diversity Gain Equation (18) that captures the approximate relationship between transmit SNR and un- reliability level is instructive: we see that a doubling in SNR reduces the unreliability by a quarter factor. This is significant improvement when compared to the earlier case of no di- versity: in that case. we conclude that 1 Pe = . (20) ℓ=1 2 3 . SN R >> 1). and in this case it is equal to 2.˜ (19) ℓ=1 where w ˜ is real Gaussian with zero mean and variance (cf. Equation (9) generalizes to Ã L ! X MF 2 y = |hℓ | x + w. For a general L. a doubling of SNR only decreased Pe by a factor of half. (15) 1 + ASNR Much like we did in earlier lectures. we have the natural extension to repetition coding at the transmitter and matched filter reception (with nearest neighbor decoding) at the receiver. we can try to simplify Equation (14) in order to better see the relationship between unreliability level and SN R. we have 1 (1 − µ) ≈ (16) ASNR (1 + µ) ≈ 2. The exponent of SNR in Equation (18) is referred to as ‘diversity gain. (17) Substituting this approximations into Equation (14). Equation (10)) Ã L ! X 2 σ2 |hℓ | . at high SNR (i.. this expression can be evaluated exactly: µ ¶2 1−µ Pe = (1 + µ) (14) 2 where r def ASNR µ= . Specifically.For the statistical model we suggested earlier (independent Rayleigh fading).

The diversity gain is even starker at lower unreliability levels. Equation (18) now becomes µ ¶ 2L − 1 1 Pe ≈ . Looking Ahead In the next two lectures we will look at two other modes of diversity: frequency and antennas. there is an exact expression for the unreliability level when the channel coefficients are independent Rayleigh distributed (as a generalization of Equation (14)): µ L−1 µ ¶L X ¶µ ¶k (1 − µ) L−1+k 1+µ . (21) ℓ=1 Again. Finally.Thus. gaming applications). (23) L (4ASNR)L The diversity gain is now L: doubling of SNR reduces the unreliability by a factor of 1 . (22) 2 k 2 k=0 where µ is as before (cf. Equation (13) generalizes to  vu Ã L ! u X Pe = E Q t2SN R |hℓ |2  . we can look for a high SNR approximation. Equation (15)). 4 . (24) 2L Figure 1 depicts the power of having time diversity. but this reduces to just 12 dB with fifth order diversity. It is instructive to see that to even have a reliably high unreliability level (per bit) of10−5 we need a SNR of almost 40dB with first order diversity. These come in handly particularly when time diversity is either absent or cannot be effective harnessed due to the tight delay constraint of the data (say.

5 .Figure 1: Bit error probability as a function of different diversity orders L.

(3) At the receiver. . .e. m + 1. looking to the frequency domain is a natural option. i. at times m. so that multiple copies of the same transmit symbol are received over different received samples. Thus the same transmit symbol (say x[m]) gets received multiple times. A Single Bit Over a Frequency Diversity Channel Suppose we have just a single√bit to transmit. . L − 1. and as an added source of diversity.. m + L − 1). . (2) x[m] = 0 m > 1. we suppose coherent reception. The simplest way to do this is to transmit the appropriate symbol x = ± E and stay silent. We see that the situation is entirely 1 . temporal diversity is either not available (in stationary scenarios) or cannot be efficiently harnessed due to the strict delay constraints of the data being commu- nicated. relative to the sampling period.e. we set √ x[1] = ± E. . . ECE 361: Fundamentals of Digital Communications Lecture 23: Frequency Diversity Introduction In many instances. we have L (complex) voltages that all contain the same transmit symbol immersed in multiplicative and additive noises: y[ℓ + 1] = hℓ x + w[ℓ + 1]. Basically. (4) As before. the receiver has full knowledge (due to accurate channel tracking) of the channel coefficients h0 . ℓ = 0. Frequency Diversity Channel Frequency diversity occurs in channels where the multipaths are spread out far enough. . The diversity option comes about because the different channel taps h0 . In these instances. . we want a multitap ISI channel response: the L-tap wireless channel L−1 X y[m] = hℓ x[m − ℓ] + w[m]. hL−1 are the result of different multipath combinations and are appropriately modeled as statistically independent. each over a statistically independent channel. hL−1 . . : i. . . . . . m≥1 (1) ℓ=0 is said to have L-fold frequency diversity. .. . (in this case.

the average error probability is generalizes to  v u ÃL−1 ! u X Pe = E Q t2SNR |hℓ |2  . (8) ℓ=0 Again.similar to that of the time diversity channel with repetition coding (as seen in the previous lecture). (10) L (4ASNR)L The diversity gain is now L: doubling of SNR reduces the unreliability by a factor of 1 . there is an exact expression for the unreliability level when the channel coefficients are independent Rayleigh distributed (just as in the time diversity case): µ L−1 µ ¶L X ¶µ ¶k (1 − µ) L−1+k 1+µ . the appropriate strategy at the receiver (as seen several times. (9) 2 k 2 k=0 where µ is as in the previous lecture. Finally. as earlier. we can look for a high SNR approximation. ˜ (6) ℓ=0 Diversity Gain Here w ˜ is real Gaussian with zero mean and variance Ã L ! X 2 σ2 |hℓ | . (7) ℓ=1 2 Thus. Then. (11) 2L 2 . including in the previous lecture on time diversity) is to match filter: "L+1 # def X y MF = ℜ h∗ℓ y[ℓ + 1] (5) ℓ=0 ÃL−1 ! X = |hℓ |2 x + w. we have: µ ¶ 2L − 1 1 Pe ≈ .

The coherence bandwidth restricts the total amount of frequency diversity available to harness. Looking Ahead In the next lecture we will see yet another form of diversity: spatial. Equation (1)). The catch is that the OFDM channel coefficients h ˜ 0. . If we choose not to stay silent. (13) Thus there are only about L “truly” independent OFDM channel coefficients and the di- versity gain is restricted. since the channel really is the one we started out with (cf. 0. . a cursory look at Equation (12) suggests that there might be Nc order diversity gain. this is restricted by the delay spread and communication bandwidth (which decides the sampling rate). . no more than L-order fre- quency diversity gain should be possible (there are only L independent channels!). n = 0. Physically. 0. . It is interesting to ask what diversity gain is possible from this channel. . Well. . It is harnessed by having antennas. once in every Nc /L tones fades independently. . This separation of frequency over which the channel response is statistically independent from one another is known as the coherence bandwidth (analogous to the coherence time we have seen earlier). However. Clearly this cannot be correct since Nc is typically much larger than L in OFDM. . Nc − 1. . . h ˜ Nc −1 are not statistically inde- pendent. . A natural way to do this is to use OFDM. . 3 . 0] . . we convert (at an OFDM block level) to the channel: ˜ n x˜n + w˜n . then we have to deal with ISI while still trying to harness frequency diversity. . Most practical wireless systems harness frequency diver- sity by a combination of having wide enough bandwidth of communication or a narrowband of communication but one that is hopped over different carrier frequencies. y˜n = h (12) This looks very much like the time diversity channel. They are the discrete Fourier transform output of the input vector [h0 . While this allowed for easy analysis (we could readily borrow from our earlier calculations) and easy harnessing of frequency diversity (so reliability really improved) it has a glaring drawback: we are only transmitting once every L symbols and this is a serious reduction in data rate. This way. except that the index n represents the “tones” or “sub-channels” of OFDM. . Since the “bandwidth” of each tone is about W1 (where W is the total bandwidth of commu- nication) we can say that the random discrete time frequency response H(f ) is independent over frequencies that are apart by about W/L. . at both transmitter and receiver. Roughly speaking.OFDM The approach so far has been very simple: by being silent over L − 1 successive symbols for every single symbol transmission we have converted the frequency diversity channel into a time diversity one with repetition coding. one for each sub-channel. hL−1 .