Exercises
ex06-01
EasyA BS with antennas serves a single user () with channel . (a) Compute the MRT precoding vector. (b) Compute the received SNR when dB.
For MRT, the precoding vector is the normalised channel conjugate.
The SNR is .
MRT vector
.
SNR
, so dB.
ex06-02
EasyShow that MRT precoding satisfies for any nonzero channel vector .
Write out the definition and compute the norm.
Direct computation
whenever .
ex06-03
EasyFor the ZF precoding matrix (unnormalised), verify that .
Multiply out and use associativity of matrix multiplication.
Verification
since any invertible matrix times its inverse is the identity.
ex06-04
MediumProve that ZF precoding requires for existence. What happens when ?
Consider the rank of .
When is a Gram matrix invertible?
Rank analysis
The matrix has rank at most . For invertibility, we need , which requires .
When $ tn{ntx} < tn{nusers}$
The matrix is rank-deficient and not invertible. There are not enough spatial dimensions to null all inter-user interference. In this case, one must either reduce the number of simultaneously served users (user scheduling) or accept nonzero interference (MRT/RZF).
ex06-05
MediumDerive the ZF power penalty. For i.i.d. Rayleigh fading, show that the expected effective channel gain per user under ZF is , compared to for MRT.
Use the fact that has an inverse chi-squared distribution.
For a Wishart matrix with , .
ZF effective gain
The effective channel gain for user under ZF is . Since for i.i.d. Rayleigh, the diagonal of the inverse satisfies .
Expected gain
By Jensen's inequality, . More precisely, (scaled chi-squared), so . The "" approximation is tight for large systems.
MRT comparison
For MRT, with . The penalty is degrees of freedom.
ex06-06
MediumShow that the RZF precoding vector is equivalent to , where is the -th standard basis vector.
Use the matrix inversion lemma (Woodbury identity).
after appropriate identification.
Apply the push-through identity
The key identity is: for conformable matrices and ,
Setting , :
Multiplying both sides on the right by gives on the left and the -th column on the right.
ex06-07
MediumFor and , compute the optimal RZF regularization parameter at dB. Interpret the result for each SNR regime.
Use .
Compute $\alpha^{\star}$
| (dB) | (linear) | |
|---|---|---|
| 0 | 1 | 4.0 |
| 10 | 10 | 0.4 |
| 20 | 100 | 0.04 |
Interpretation
At 0 dB: is large, so RZF behaves like MRT β noise dominates and we should maximise signal power. At 10 dB: moderate regularization balances signal, interference, and noise. At 20 dB: , so RZF approaches ZF β interference dominates and should be nulled.
ex06-08
MediumProve that MRT precoding is the MMSE estimator of the intended signal at the receiver, in the following sense: minimises over all receive combiners , where .
This is the standard MMSE/matched filter derivation.
The MMSE receiver for is proportional to .
MMSE derivation
The MMSE receiver is where . Since , we get . By the matrix inversion lemma, this is proportional to , confirming MRT/MRC optimality for the single-user case.
ex06-09
HardDerive the sum-rate expression for RZF precoding with optimal in the large-system limit where with fixed and .
Show that the per-user rate converges to
Use the Marchenko--Pastur law for the eigenvalue distribution of .
The resolvent trace converges: where is the Stieltjes transform.
At optimal , the deterministic equivalent simplifies.
Large-system SINR
By the resolvent identity and trace lemma, the per-user SINR under RZF converges almost surely to
where is the Stieltjes transform evaluated at .
Optimal $\alpha$ simplification
Setting and solving the Marchenko--Pastur fixed-point equation yields
giving the stated per-user rate .
ex06-10
HardConsider the MIMO BC with , , and channels , .
(a) Compute the DPC sum capacity with dB. (b) Compute the ZF sum rate. (c) What is the gap?
Since , ZF does not lose any degrees of freedom.
For orthogonal channels, DPC and ZF achieve the same rates.
Orthogonality
, so the channels are orthogonal. ZF does not need to null any interference (it is already zero), so and no power penalty occurs.
Rates
for both users. With equal power :
bits/s/Hz.
Sum rate bits/s/Hz for both ZF and DPC.
Gap
The gap is exactly zero. When channels are orthogonal, linear precoding is capacity-achieving: no DPC is needed. This is the favorable propagation condition of massive MIMO.
ex06-11
HardShow that the RZF sum rate converges to the MRT sum rate as (low-SNR regime) and to the ZF sum rate as (high-SNR regime).
At low SNR, so RZF MRT.
At high SNR, so RZF ZF.
Low-SNR limit
as . Then and MRT up to scaling.
High-SNR limit
as . Then and . The sum rates converge accordingly.
ex06-12
MediumA system with and uses RZF precoding at dB. Compute the per-user rate using the large-system approximation where .
Compute first, then substitute.
Compute $\rho$
(linear scale, since ).
Per-user rate
bits/s/Hz.
Sum rate
bits/s/Hz. This is the large-system approximation; Monte Carlo gives bits/s/Hz.
ex06-13
HardProve the MAC-BC duality for the sum capacity: show that the maximum sum rate achievable in the MIMO BC with sum power equals the maximum sum rate of the dual MAC with sum power .
The MAC sum capacity is where is diagonal with .
Use the BC sum capacity expressed via DPC with encoding order .
Show both reduce to at equal power.
MAC sum capacity
The MAC sum capacity with sum power and equal allocation is
BC sum capacity via DPC
By the DPC achievability and the chain rule for mutual information, the BC sum capacity also equals
optimised over with .
Equality
Both expressions have the same form: where . The optimal is the same in both cases (water-filling over the eigenvalues of ), so .
ex06-14
HardShow that for two users () with correlated channels having correlation coefficient , the ZF power penalty increases with . Specifically, show that the effective gain decreases as when is large.
For two users, the Gram matrix is with off-diagonal proportional to .
Invert the Gram matrix explicitly.
Two-user Gram matrix
For large with :
for some phase .
Inverse
1/(N_t(1-r^2))g_k^{\text{ZF}} \approx N_t(1-r^2)r \to 1\blacksquare$
ex06-15
ChallengeDesign a per-antenna power constrained precoder for the following system: , , per antenna,
and .
(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.
Compute first.
Check for each antenna.
If violated, the PAPC solution requires scaling down the offending antenna.
Unconstrained ZF
Compute , .
.
Check PAPC
With (assuming ), the per-antenna power of the normalised precoder varies across antennas. The maximum per-antenna power exceeds for some configurations, requiring the iterative PAPC algorithm or SOCP solution.
PAPC solution and comparison
The PAPC-constrained precoder redistributes power more uniformly, resulting in a small sum-rate reduction. The exact numerical values depend on the power allocation, but the rate loss is typically 2--5% for this moderate system size.
ex06-16
MediumFor MRT precoding with and , compute the sum rate at dB. Use the approximation that favorable propagation makes inter-user interference negligible.
With favorable propagation, each user sees an interference-free channel with gain .
MRT in massive regime
With favorable propagation (), the SINR approximates .
Per-user rate: bits/s/Hz. Sum rate: bits/s/Hz.
ex06-17
EasyWhat is the computational complexity of computing the ZF precoding matrix for and ? Express in terms of floating-point operations.
The bottleneck is and its inversion.
Complexity
The Gram matrix costs . The Cholesky factorisation costs . The back-multiplication costs . Total: complex multiply-adds per subcarrier.
ex06-18
ChallengeConsider a system where the BS has imperfect CSI: where . The BS uses RZF precoding based on .
(a) Show that the optimal regularization with imperfect CSI is .
(b) Interpret why the estimation error acts like additional noise.
Write the received signal with the true channel and substitute .
The interference from estimation error is proportional to .
Effective noise
The received signal at user is .
The last two terms form an effective noise with variance .
Modified regularization
Replacing with in the optimal formula:
The estimation error "raises the noise floor" by , pushing RZF away from ZF and toward MRT β which makes sense since imperfect CSI degrades interference cancellation.