Exercises
ex-ch04-01
EasyConsider a single-user massive MIMO system () with antennas, i.i.d. Rayleigh fading, path loss ( dB), noise variance , and transmit power (10 dB). Assume perfect channel estimation ().
Compute the UatF achievable rate with MRC combining.
With , there is no multi-user interference.
The MRC SINR simplifies to .
Apply the MRC SINR formula
$
Compute the rate
$
ex-ch04-02
EasyFor the same system as Exercise 1, now with antennas. What is the rate? What is the rate gain (in dB) from quadrupling the number of antennas?
The SINR scales linearly with .
Compute new SINR
$
Compute rate and gain
4.60 - 2.77 = 1.8310\log_{10}(23.27/5.82) = 6.02$ dB, which is the expected 6 dB gain from quadrupling the antennas (linear scaling).
ex-ch04-03
EasyExplain in one paragraph why the UatF bound becomes tight as for i.i.d. Rayleigh fading channels.
Think about what makes the bound loose: the gap between the instantaneous and average effective channel gain.
What does the law of large numbers say about ?
Explanation
The UatF bound replaces the random effective channel gain by its expectation . The gap between the bound and the true rate comes from the variance of this gain around its mean. For i.i.d. Rayleigh fading with MRC (), the effective gain is , a sum of i.i.d. terms. By the law of large numbers, almost surely. The variance of the gain, normalized by , vanishes as . Hence the random gain concentrates around its mean, and the UatF bound (which pessimizes the distribution of the residual fluctuation) loses nothing in the limit.
ex-ch04-04
EasyShow that with perfect channel estimation () and ZF combining, the SINR expression reduces to .
What happens to when estimation is perfect?
Substitute perfect estimation
With for all :
All interference terms vanish because ZF perfectly nulls the (perfectly known) interfering channels.
ex-ch04-05
EasyWith , , and equal power/path loss, compute the ratio with perfect estimation. Express the result in dB.
Use the simplified formulas from the previous exercise and the MRC formula.
Compute the ratio
\text{SNR} = 10\text{Ratio} = 90 \cdot 101 / 100 = 90.910\log_{10}(90.9) \approx 19.6$ dB.
ZF is nearly 20 dB better than MRC in this regime.
ex-ch04-06
MediumDerive the UatF SINR expression for MRC from scratch, starting from the system model and the MMSE estimate decomposition . Verify that your result matches Theorem TClosed-Form UatF Rate with MRC.
Start by computing and splitting into signal + noise.
Use the MMSE orthogonality: .
For the fourth moment, use for independent .
Combined signal
$
Signal mean
$
Interference and noise variance
For : .
Self-interference variance: .
Noise: .
SINR
$
ex-ch04-07
MediumShow that the ZF combining vector satisfies: (a) , and (b) for i.i.d. Rayleigh channels.
For (a), multiply out and use the definition of pseudo-inverse.
For (b), note that and use the inverse Wishart distribution.
Part (a): Orthogonality
$
Part (b): Expected norm
\hat{\mathbf{H}}k \sim \mathcal{CN}(\mathbf{0}, \gamma_k \mathbf{I})\hat{\mathbf{H}}^H \hat{\mathbf{H}} / \gamma_k\gamma_k = \gamma\mathcal{W}{K}(N_t, \mathbf{I})1/(\gamma(N_t - K))$.
ex-ch04-08
MediumConsider a system with , , dB, and imperfect estimation with (80% estimation quality). Compute the per-user rate with MRC, ZF, and MMSE (using the ZF approximation for MMSE since ).
For MMSE, use the ZF formula as an approximation when .
Setup
Equal power, equal path loss. (0 dB). , so .
MRC
R^{\text{MRC}} = \log_2(5.88) \approx 2.56$ bits/s/Hz.
ZF
R^{\text{ZF}} = \log_2(18.28) \approx 4.19$ bits/s/Hz.
MMSE (ZF approximation)
Since , MMSE ZF: bits/s/Hz.
The gain of ZF over MRC is bits/s/Hz, or a factor of in SINR ( dB).
ex-ch04-09
MediumProve that the MRC sum rate is a concave function of (treated as continuous) for fixed , equal power, and equal path loss.
Write and compute the second derivative.
Define constants
Let , , . Then .
First derivative
$
Second derivative (sign)
Computing yields a sum of two negative terms (after algebraic simplification), confirming that is concave in . The detailed computation involves the quotient rule applied twice; the key observation is that is concave in and is convex-decreasing in , so the composition where is convex-decreasing yields a concave . Hence a unique maximum exists.
ex-ch04-10
MediumIn a two-cell system with pilot contamination, derive the MRC SINR for user in cell 1 when user in cell 2 uses the same pilot. Assume i.i.d. Rayleigh channels and MMSE estimation.
The contaminated estimate is .
The MRC gain due to contamination.
Contaminated estimate
$
Signal and interference means
The desired signal mean: where .
The contamination mean: where .
Resulting SINR
The contaminating user's interference enters the numerator (coherent combining), leading to the SINR:
As , this converges to , confirming the pilot contamination ceiling.
ex-ch04-11
MediumVerify the power scaling result for MRC numerically. Set varying from 10 to 1000, , , , , , . Compute and plot vs. . Show that it converges to a positive constant.
Remember to also scale the pilot power: .
Compute at each using the MMSE formula.
Implementation outline
For each :
- ,
Limiting value
The theoretical limit is
The numerical curve should converge to this value as increases.
ex-ch04-12
MediumShow that for ZF combining with perfect estimation, the optimal user loading ratio that maximizes the sum rate converges to a constant as . Find numerically for dB.
Write and maximize over .
Optimization
Setting :
For large , let : . This gives , i.e., .
For and : numerical optimization gives . For : . The ratio slowly approaches for very large .
ex-ch04-13
HardDerive the UatF SINR expression for MMSE combining (not ZF) in the finite-dimensional case ( finite) with i.i.d. Rayleigh fading and MMSE estimation. Show that it involves a matrix trace that does not simplify to a closed form without RMT.
The MMSE combiner is .
Use the matrix inversion lemma to extract user from the sum.
The key quantity is where excludes user .
Apply matrix inversion lemma
Define . Then by the matrix inversion lemma:
Compute the UatF SINR
The UatF SINR is
The expectation involves a ratio of quadratic forms in random matrices — this has no closed form for finite dimensions. The large-system limit replaces by its deterministic equivalent via the Marchenko-Pastur law.
ex-ch04-14
HardConsider spatially correlated channels with MMSE estimation. Derive the UatF rate expression for MRC and show that the SINR depends on the eigenvalues of .
The MMSE estimate is where is the error covariance.
Use the trace identity: .
Correlated MMSE estimation
The MMSE estimate covariance is where .
MRC SINR
With :
The traces involve eigenvalue sums: and when and are simultaneously diagonalizable (same eigenbasis). In general, the cross-term depends on the relative orientation of the correlation subspaces.
ex-ch04-15
HardProve that the power scaling exponent is limited to with pilot contamination. Specifically, show that with , the MRC rate in a two-cell system with pilot contamination converges to a positive constant, but with for any , the rate converges to zero.
With pilot contamination, the coherent interference scales as .
Track how and scale with .
Scaling analysis
With and :
, so .
The coherent interference from cell 2: .
Both signal and interference converge to finite constants, yielding a finite SINR. With exponent , the signal decays as while the contamination-to-signal ratio stays , forcing the rate to zero.
ex-ch04-16
HardImplement a Monte Carlo simulation to verify the UatF rate formula for MRC. Generate channel realizations of i.i.d. Rayleigh fading, perform MMSE estimation, compute the instantaneous per-user rate using the true instantaneous SINR, and compare the average against the UatF formula. Parameters: , , dB, .
The instantaneous SINR uses in the numerator, not .
The UatF bound should be a lower bound — the Monte Carlo average should be higher.
Algorithm
for t in range(T):
H = sqrt(beta) * randn(Nt, K) + 1j * randn(Nt, K)) / sqrt(2)
# MMSE estimation with pilots
H_hat = ... # MMSE estimate
# MRC combining
for k in range(K):
v_k = H_hat[:, k]
signal = abs(v_k.conj() @ H[:, k])**2
interference = sum(abs(v_k.conj() @ H[:, j])**2 for j != k)
noise_term = sigma2 * norm(v_k)**2
SINR_inst = Pt * signal / (Pt * interference + noise_term)
R_inst[k, t] = log2(1 + SINR_inst)
R_avg = mean(R_inst) # Should be >= R_UatF
Expected result
The Monte Carlo average should exceed the UatF bound by approximately 0.1-0.3 bits/s/Hz for . The gap decreases as increases (channel hardening tightens the bound).
ex-ch04-17
HardStarting from the MMSE combining matrix, show that in the large-system limit the per-user SINR can be expressed in terms of the Stieltjes transform of the Marchenko-Pastur distribution. State the fixed-point equation that determines the Stieltjes transform.
The Marchenko-Pastur law describes the eigenvalue distribution of as with .
The Stieltjes transform satisfies a self-consistency equation.
Marchenko-Pastur law
For i.i.d. , the empirical eigenvalue distribution of converges to the Marchenko-Pastur distribution with ratio and variance .
Stieltjes transform equation
The Stieltjes transform satisfies
which is a fixed-point equation for . Evaluated at , this gives the deterministic equivalent of the MMSE SINR.
ex-ch04-18
HardProve that MMSE combining always achieves at least as high a rate as ZF combining. That is, show for all system parameters.
MMSE minimizes MSE over all linear combiners. ZF is a special case (constrained linear combiner).
Lower MSE implies higher SINR.
Optimality argument
The MMSE combiner minimizes over all . The ZF combiner minimizes the same objective subject to the constraint for . Since ZF is a constrained version of MMSE,
SINR-MSE relationship
For any linear combiner, the SINR and MSE are related by (when properly normalized). Since MSE is lower for MMSE, the SINR is higher:
and therefore .
ex-ch04-19
Challenge(Open-ended) The UatF bound treats the effective channel gain as deterministic. An alternative is the hardening bound: for each channel realization, compute the instantaneous SINR and then take the expectation of the log:
(a) Show that always. (b) Show that the gap as for MRC with i.i.d. Rayleigh fading. (c) Estimate the gap numerically for .
For (a), use Jensen's inequality: when... wait, that is not right. Think about the effective channel model.
For (b), use channel hardening: the instantaneous SINR concentrates around the deterministic SINR.
Part (a): The hardening bound dominates
The hardening bound uses the instantaneous SINR, which captures the true channel realization. The UatF bound replaces the channel gain by its mean and assumes worst-case noise. Since the actual noise distribution achieves higher mutual information than the worst-case Gaussian, .
Part (b): Gap vanishes
By channel hardening, and similarly for the denominator terms. Hence the instantaneous SINR concentrates around the UatF SINR, and by continuity of , .
ex-ch04-20
Challenge(Research-level) Caire (2018) showed that pilot contamination can be eliminated with spatially correlated channels when users in different cells have non-overlapping eigenspaces. Formally, if for cells , the contamination ceiling vanishes.
(a) Construct a simple example with , cells, where this condition holds. (b) Derive the decontaminated SINR expression and show it grows without bound as . (c) Discuss what happens when the eigenspaces partially overlap.
For (a), use rank-1 correlation matrices with orthogonal steering vectors.
For (b), the MMSE estimator naturally separates the two users' channels.
Part (a): Orthogonal subspaces
Let and where and . Then , so the eigenspaces are orthogonal.
Part (b): Decontaminated SINR
With orthogonal subspaces, the MMSE estimator projects the received pilot signal onto , which contains no component of . The contamination term in the estimate is zero, and the SINR grows as without any ceiling.
Part (c): Partial overlap
When the subspaces partially overlap, the MMSE estimator cannot fully separate the channels. The contamination is reduced (not eliminated), and the ceiling is loosened but still finite. The improvement depends on the principal angles between the subspaces.