Exercises

ex06-01

Easy

A BS with Nt=4N_t = 4 antennas serves a single user (K=1K = 1) with channel h=[1,j,βˆ’1,βˆ’j]T\mathbf{h} = [1, j, -1, -j]^T. (a) Compute the MRT precoding vector. (b) Compute the received SNR when Pt/Οƒ2=20P_t/\sigma^2 = 20 dB.

ex06-02

Easy

Show that MRT precoding satisfies βˆ₯vkMRTβˆ₯=1\|\mathbf{v}_{k}^{\text{MRT}}\| = 1 for any nonzero channel vector hk\mathbf{h}_k.

ex06-03

Easy

For the ZF precoding matrix WZF=HH(HHH)βˆ’1\mathbf{W}^{\text{ZF}} = \mathbf{H}^{H}(\mathbf{H}\mathbf{H}^{H})^{-1} (unnormalised), verify that HWZF=IK\mathbf{H}\mathbf{W}^{\text{ZF}} = \mathbf{I}_{K}.

ex06-04

Medium

Prove that ZF precoding requires Ntβ‰₯KN_t \geq K for existence. What happens when Nt<KN_t < K?

ex06-05

Medium

Derive the ZF power penalty. For i.i.d. Rayleigh fading, show that the expected effective channel gain per user under ZF is Ntβˆ’KN_t - K, compared to NtN_t for MRT.

ex06-06

Medium

Show that the RZF precoding vector v~k=(HHH+Ξ±I)βˆ’1hk\tilde{\mathbf{v}}_k = (\mathbf{H}^{H}\mathbf{H} + \alpha\mathbf{I})^{-1}\mathbf{h}_k is equivalent to HH(HHH+Ξ±I)βˆ’1ek\mathbf{H}^{H}(\mathbf{H}\mathbf{H}^{H} + \alpha\mathbf{I})^{-1}\mathbf{e}_k, where ek\mathbf{e}_k is the kk-th standard basis vector.

ex06-07

Medium

For Nt=16N_t = 16 and K=4K = 4, compute the optimal RZF regularization parameter at Pt/Οƒ2=0,10,20P_t/\sigma^2 = 0, 10, 20 dB. Interpret the result for each SNR regime.

ex06-08

Medium

Prove that MRT precoding is the MMSE estimator of the intended signal at the receiver, in the following sense: vkMRT\mathbf{v}_{k}^{\text{MRT}} minimises E[∣skβˆ’gHy∣2]\mathbb{E}[|s_k - \mathbf{g}^H \mathbf{y}|^2] over all receive combiners g\mathbf{g}, where y=hksk+w\mathbf{y} = \mathbf{h}_k s_k + \mathbf{w}.

ex06-09

Hard

Derive the sum-rate expression for RZF precoding with optimal Ξ±\alpha in the large-system limit where Nt,Kβ†’βˆžN_t, K \to \infty with Ξ²=K/Nt∈(0,1)\beta = K/N_t \in (0,1) fixed and ρ=Pt/(KΟƒ2)\rho = P_t/(K\sigma^2).

Show that the per-user rate converges to

RRZFβ†’log⁑2 ⁣(1+ρ(Ntβˆ’K)).R^{\text{RZF}} \to \log_2\!\left(1 + \rho(N_t - K)\right).

ex06-10

Hard

Consider the MIMO BC with Nt=4N_t = 4, K=2K = 2, and channels h1=[1,0,1,0]T\mathbf{h}_1 = [1, 0, 1, 0]^T, h2=[0,1,0,1]T\mathbf{h}_2 = [0, 1, 0, 1]^T.

(a) Compute the DPC sum capacity with Pt/Οƒ2=10P_t/\sigma^2 = 10 dB. (b) Compute the ZF sum rate. (c) What is the gap?

ex06-11

Hard

Show that the RZF sum rate converges to the MRT sum rate as Pt/Οƒ2β†’0P_t/\sigma^2 \to 0 (low-SNR regime) and to the ZF sum rate as Pt/Οƒ2β†’βˆžP_t/\sigma^2 \to \infty (high-SNR regime).

ex06-12

Medium

A system with Nt=64N_t = 64 and K=16K = 16 uses RZF precoding at Pt/Οƒ2=10P_t/\sigma^2 = 10 dB. Compute the per-user rate using the large-system approximation Rkβ‰ˆlog⁑2(1+ρ(Ntβˆ’K))R_k \approx \log_2(1 + \rho(N_t - K)) where ρ=Pt/(KΟƒ2)\rho = P_t/(K\sigma^2).

ex06-13

Hard

Prove the MAC-BC duality for the sum capacity: show that the maximum sum rate achievable in the MIMO BC with sum power PtP_t equals the maximum sum rate of the dual MAC with sum power PtP_t.

ex06-14

Hard

Show that for two users (K=2K = 2) with correlated channels having correlation coefficient r=∣h1Hh2∣/(βˆ₯h1βˆ₯βˆ₯h2βˆ₯)r = |\mathbf{h}_1^H\mathbf{h}_2|/(\|\mathbf{h}_1\|\|\mathbf{h}_2\|), the ZF power penalty increases with rr. Specifically, show that the effective gain decreases as gZF∝(1βˆ’r2)g^{\text{ZF}} \propto (1 - r^2) when NtN_t is large.

ex06-15

Challenge

Design a per-antenna power constrained precoder for the following system: Nt=4N_t = 4, K=2K = 2, Pmax⁑/Nt=1P_{\max}/N_t = 1 per antenna,

H=[12100121]\mathbf{H} = \begin{bmatrix} 1 & 2 & 1 & 0 \\ 0 & 1 & 2 & 1 \end{bmatrix}

and Οƒ2=1\sigma^2 = 1.

(a) Compute the unconstrained ZF precoder and verify whether it satisfies the PAPC. (b) If not, formulate the SOCP and solve it (numerically or analytically for this small system). (c) Compare the sum rate with and without PAPC.

ex06-16

Medium

For MRT precoding with Nt=128N_t = 128 and K=8K = 8, compute the sum rate at Pt/Οƒ2=0P_t/\sigma^2 = 0 dB. Use the approximation that favorable propagation makes inter-user interference negligible.

ex06-17

Easy

What is the computational complexity of computing the ZF precoding matrix for Nt=64N_t = 64 and K=16K = 16? Express in terms of floating-point operations.

ex06-18

Challenge

Consider a system where the BS has imperfect CSI: h^k=hk+h~k\hat{\mathbf{h}}_k = \mathbf{h}_k + \tilde{\mathbf{h}}_k where h~k∼CN(0,Οƒe2I)\tilde{\mathbf{h}}_k \sim \mathcal{CN}(\mathbf{0}, \sigma_e^2 \mathbf{I}). The BS uses RZF precoding based on H^\hat{\mathbf{H}}.

(a) Show that the optimal regularization with imperfect CSI is αeff=K(σ2+Ptσe2/K)/Pt\alpha_{\text{eff}} = K(\sigma^2 + P_t\sigma_e^2/K)/P_t.

(b) Interpret why the estimation error acts like additional noise.