Spring 2017 MIMO Communication Systems

Department of Electrical and Computer Engineering

National Chiao Tung University

Exam II

May 23, 2017

6:30 pm ∼ 10:00 pm

Do not open the exam until you are told to do so.

SOLUTION

Problem Points Your Score

1 20
2 40
3 30
4 30
5 30
Total 150

Read all of the following information before starting the exam:

• This exam is closed book, but you are allowed to bring a calculator and one A4-sized
“hand-written” sheet that contains the information you need during the exam.

• Show all your work clearly and in order if you want to get full credit. I reserve the
right to take off points if I cannot see how you arrived at your answer (even if your
final answer is correct).

• This exam has 5 problems (4 pages) and is worth 150 points. It is your responsibility
to make sure that you have all of the pages!

• Good luck!

1
Problem 1 (20 points)

Answer the following questions with clear explanations.

(a) What are channel-inversion and truncated channel inversion power adaption policies?
Which one is better in a Rayleigh fading environment? Why?
Sol: Please see the lecture slides.
(b) Consider a 2 × 2 MIMO channel between a transmitter and a receiver. For some reason,
the receiver cannot feedback the channel state information to the transmitter. What
transmission technique/method can be used for the transmitter to achieve the diversity
gain of 2? Can this transmission technique/method achieve the array gain of 2? Explain
your reason.
Sol: The Alamouti scheme can achieve diversity order 2, but it cannot achieve array
gain 2 since it cannot optimally allocate power to the 2 transmit antennas.
(c) Consider the uplink transmission scenario in which a base station equipped with 4Mt
antennas is receiving signals from a user equipped with Mt antennas. If the base station
would like to have a multiplexing gain r ≥ M2t . What is the diversity gain that can be
exploited for the base station?
Sol:
(d) Explain why multicarrier modulation does not suffer frequency-selective fading and why
an OFDM transmission system can completely eliminate inter-symbol interference (ISI).
Do we need to put an equalizer in an OFDM receiver?
Sol: See the lecture slides.

Problem 2 (40 points) [MIMO Channel Capacity]

Consider a 2 × 2 MIMO system with channel gain matrix H given by

 
0.4 0.3
H=
0.5 0.8
Assume H is known at both the transmitter and receiver, and that there is a total transmit
power of P = 20mW across the two transmit antennas, AWGN with power N0 = 10−9 W/Hz
at each receive antenna, and bandwidth B = 200 KHz.
(a) Complete the SVD of H given in the following, i.e., find σ1 , σ2 , x and y.
   
−0.4538 x σ1 0 −0.5941 −0.8044
H= .
−0.8911 0.4538 0 σ2 −0.8044 y
Sol: Solving the SVD gives x = −0.8911, y = 0.5941, σ1 = 1.0555 and σ2 = 0.1611.
(b) Find the capacity of this channel.
Sol: The capacity is
2  
X γi
C=B log2
i=1
γ0

2
 if the following water filling power allocation is used
(
1
Pi γ0
− γ1i , γi ≥ γ0
= , i = 1, 2.
P 0 , γi < γ0

Since σn2 = BN0 = 0.2mW, σ12 = 1.114 and σ22 = 0.026, we have γ1 = σ12 P/σn2 = 111.4
and γ2 = σ22 P/σn2 = 2.6. Now assume γ1 and γ2 are both greater than γ0 . So we have
2
γ0
− γ11 − γ12 = γ20 − 0.1034 = 1, which gives γ0 = 1.435. Hence, all γi ’s are greater than
γ0 and that matches the original assumption. The capacity is calculated by
    
111.4 2.6
C = 200 × log2 + log2 = 1427.2 Kbps.
1.435 1.435

(c) Assuming transmit precoding and receiver shaping is used to transform this channel into
two parallel independent channels with a total power constraint P . Find the maximum
data rate that can be transmitted over this parallel set assuming MQAM modulation
on each channel with optimal power adaptation across the channels subject to power
constraint P . Assume a target BER of 10−3 on each channel, the BER is bounded by
≤ 0.2e−1.5γ/(M −1) and the constellation size of the MQAM is unrestricted.
Sol: Since P b = 10−3 ≤ 0.2e−1.5γ/(M −1) , we have
P (γ)
M (γ) = 1 + γK ,
P
1.5
where K = − ln(5P b)
= 0.283 < 1. Now wee need to find the cutoff value γ0 . First
assume that both γ1 and γ2 found in part (b) are greater than γ0 . Thus, we have
 
2 1 1 1 1 1 1
− − =1⇒ = 1+ + .
γ0 γ1 K γ2 K γ0 2 γ1 K γ2 K
So we can find γ0 = 0.8365, which is just less than Kγ1 , so our assumption was
incorrect, which means only the channel with γ1 should be used. The total rate is
given by  
γ1 K
R = B log2 = 1047.2 Kbps.
γ0
(d) Suppose now that the antennas at the transmitter and receiver are all used for diversity
with optimal weighting at the transmitter and receiver to maximize the SNR of the
combiner output. Find the SNR of the combiner output, and the BER of a BPSK
modulated signal transmitted over this diversity system.
Sol: The SNR at the combiner is simply ρλmax where λmax is the maximum eigenvalue
of HHH and ρ = NP0 B . For the given H, we can calculate λmax = 1.114 and ρ = 100 so
√
that γb = 111.4. For BPSK, we have Pb = Q( 2γb ) ≈ 0.

Problem 3 (30 points) [A Cellular System with Hexagonal Cells]

Consider a cellular system with hexagonal cells of radius R = 1 Km. Suppose the minimum
distance between cell centers using the same frequency must be D = 7.5 Km to maintain
the required SIR.

3
(a) Find the number of cells per cluster.

2 1 7.5
2
Sol: N = 13 D
R
=3 1 = 18.75 and use N = 19.

(b) If a total system bandwidth is 57 MHz and a required signal bandwidth for each user of
100 KHz, calculate the user capacity.
Sol: The user capacity is
57 × 103
Cu = = 30 (users/cell).
100 × 19

(c) Find the minimum SIR of a user in a cell if all channels in the system only have path
loss with the same path loss exponent α = 3, and no interference from outside the first
ring of 6 interfering cells.
Sol: The minimum SIR of a user is the SIR of the user at one of the vertex of a cell.
Thus,  α  3
1 D 1 7.5
SIRmin = = = 70.31 = 18.47 dB.
M R 6 1

Problem 4 (30 points) [Sectored Cellular Networks]

Consider a TDMA cellular system with hexagon-shaped cells, path loss exponent and BPSK
modulation. Assume that the received signal exhibits Rayleigh fading, the average BER
required for each user is P b = 10−3 , a total system bandwidth of 20 MHz and a required
signal bandwidth of 100 KHz for each user. The system is interference-limited.
(a) Assume path loss exponent for all signal propagation in the system is γ = 3. Find the
minimum reuse factor N needed to meet the BER requirement, and then find the user
capacity.
Sol: For hexagon-shaped cells, we have
 2/3
1 SIR0
N≥ ,
3 0.167

where SIR0 ≈ 4P1 . Since SIR0 = 250, N ≥ 43.62. So the minimum of N is 44. The user
b
capacity is Cu = NT /N = (20000/100)/44 = 4.54.

(b) Now consider that each cell in the system is equally partitioned into K sectors and every
sector of all cells always has users (i.e. the heavy loading case). Find the the minimum
reuse factor N needed to meet the BER requirement and the user capacity.
Sol: The SIR of a user at a cell vertex is
 γ  2/γ
K D K γ 6SIR0
SIR = = (3N ) 2 ⇒ N ≥ .
6 R 6 K
The user capacity is
 2/γ
B B K
Cu = = .
N Bu Bu 6SIR0

4
(c) Now we consider another case that each cell in the system is also equally partitioned
into K sectors, but the hand-off probability for users moving between sectors is 1 − K1 .
Find the optimal values of K and N that maximizes the user capacity subject to the
constraint 1 − K1 ≤ .
Sol: Let us define the following Lagrangian equation:
 2/γ  
B K 1
L= −λ 1− − .
Bu 6SIR0 K

So we can have
dL 2B 2/γ−1 λ
= K (6SIR0 )−2/γ − 2 = 0,
dK Bu γ K
which gives γ
  γ+2
γλBu 2
K= (6SIR0 ) γ+2 .
2B
1
Substituting the above K into 1 − K
=  leads to
  γ+2   γ2
1 γ B
λ= .
1− 6γBu SIR0

The optimal N is given by

 2
 γ+2
12BSIR0
N= .
γλBu
The user capacity in this case is
 2 
 γ+2 γ
 γ+2
B γλ B
Cu = = .
N Bu 12SIR0 Bu

Problem 5 (30 points) [Uplink Power Control]

Consider a base station is going to receive signals from three users. In the uplink, the channel
power gain from user k to the base station is d−α k where dk is the distance between user k
and the base station, α is the path loss exponent, the transmit power of user k is Pk , and the
minimum SINR requirement for user k is γk∗ , k = 1, 2, 3. Due to signal processing at the base
station, the interference power received by the base station can be reduced by multiplying a
factor ρ < 1. The noise power received by each user is the same σ02 .

(a) Suppose now that the base station is unable to successfully decode the signals from user
3 and thus they are treated as noise. Write down the two SINR inequalities of the
other two users for successful decoding and use them to express the matrix inequality
(I − F)P ≥ v where P = [P1 P2 ]T .
Sol: Treating the signals of user 3 as noise, the SINRs of users 1 and 2 are

P1 d−α
1 ∗ P2 d−α
2 ∗
γ1 = −α ≥ γ1 , γ2 = −α ≥ γ2
σ02 + ρ(P2 d−α
2 + P 3 d3 ) σ02 + ρ(P1 d−α
1 + P 3 d 3 )

5
 They can be rewritten as a matrix form as follows
   α 
∗ d1
0 ργ
      ∗ α 
1 0 1 d2 P 1 2 ρP 3 γ1 d1
−  α ≥ σ0 + α
γ2∗ dα2
 
0 1 ργ2∗ d2
0 P 2 d3
d1

(b) Now consider the following iterative Foschini-Miljanic algorithm for power adaptation
of users 1 and 2
P(n + 1) = FP(n) + v,
where F and v are found in part (a). Show that P(n) converges as n goes to infinity,
i.e. P(∞) = limn→∞ P(n) exists. What is P(∞)?
Sol: To make P(n) converge, we must have λF < 1 where λF is the Perron-Frobenius
eigenvalue
p of F, i.e. the maximum
√ positive real eigenvalue
√ of F. We can find λF =
ρ γ1∗ γ2∗ (d1 /d2 )α (d2 /d1 )α = ρ γ1∗ γ2∗ and thus λF = ρ γ1∗ γ2∗ < 1, which ensure that
P(n) converges. Now since P(n)converges and thus P(∞) = FP(∞) + v. In other
words, we must have  
−1 P1 (∞)
P(∞) = (I − F) v = ,
P2 (∞)
where P1 (∞) and P2 (∞) are given by
γ1∗
 
ρP3
P1 (∞) = σ02 + (dα1 + ργ2∗ dα2 ) ,
(1 − ρ2 ) dα3
γ2∗
 
ρP3
σ02 + dα2 + ργ1∗ d31 .


P2 (∞) = α
(1 − ρ2 ) d3

(c) Since the signals from user 3 cannot be decoded and thus they are treated as noise, the
power P3 of user 3 cannot be adapted. By using the steady-state powers of users 1
and 2 found in part (b), find the constraint on γk∗ and ρ such that the signals of user
3 cannot be decoded by the base station when d1 = d2 and power P3 is very large.
Sol: The SINR of user 3 is given by
! α1
P3 d−α P3
γ3 = 3
−α < γ3∗ ⇒ d3 > .
P2 d−α σ0 + ρ(P1 d−α −α
 2 
σ02 + ρ(P1 d1 + 2 ) γ3∗ 1 + P2 d 2 )

When P3 → ∞, P1 and P2 can be approximated by

γ1∗ ρP3
P1 ≈ 2 α
(dα1 + ργ2∗ dα2 )
(1 − ρ )d3
γ2∗ ρP3
P2 ≈ 2 α
(dα2 + ργ1∗ dα1 )
(1 − ρ )d3
The constraint that makes user 3 not decoded is
γ3∗ ρ2
[γ ∗ (1 + ργ2∗ ) + γ2∗ (1 + ργ2∗ )] > 1.
(1 − ρ2 ) 1