Favorable Propagation

The Inter-User Orthogonality Miracle

In conventional MIMO, users' channels are generally correlated, and this correlation limits performance. Interference between users is a fundamental bottleneck. Favorable propagation is the second key property of massive MIMO: as Ntβ†’βˆžN_t \to \infty, the channel vectors of different users become asymptotically orthogonal β€” their inner product normalized by NtN_t vanishes. When this holds, intra-cell interference disappears even with the simplest linear processing, and the multi-user channel decouples into KK independent parallel channels.

Definition:

Favorable Propagation

The channel vectors {h1,…,hK}\{\mathbf{h}_1, \ldots, \mathbf{h}_{K}\} satisfy favorable propagation if for any two users kβ‰ jk \neq j:

1NthkHhjβ†’Ntβ†’βˆž0,\frac{1}{N_t}\mathbf{h}_k^H\mathbf{h}_j \xrightarrow{N_t \to \infty} 0,

and simultaneously:

1NthkHhkβ†’Ntβ†’βˆžΞ²k.\frac{1}{N_t}\mathbf{h}_k^H\mathbf{h}_k \xrightarrow{N_t \to \infty} \beta_{k}.

In matrix form: 1NtHHHβ†’Ntβ†’βˆždiag(Ξ²1,…,Ξ²\ntnnusers)\frac{1}{N_t}\mathbf{H}^{H}\mathbf{H} \xrightarrow{N_t \to \infty} \text{diag}(\beta_{1}, \ldots, \beta_{\ntn{nusers}}).

Favorable propagation combines channel hardening (diagonal terms) with inter-user orthogonality (off-diagonal terms vanishing). The two conditions together imply that the Gram matrix 1NtHHH\frac{1}{N_t}\mathbf{H}^{H}\mathbf{H} becomes diagonal β€” the multi-user channel is asymptotically equivalent to KK parallel AWGN channels.

,

Favorable Propagation

The property that channel vectors of different users become asymptotically orthogonal as the number of BS antennas Ntβ†’βˆžN_t \to \infty: 1NthkHhjβ†’0\frac{1}{N_t}\mathbf{h}_k^H \mathbf{h}_j \to 0 for kβ‰ jk \neq j. Enables simple linear processing to achieve near-optimal sum-rate.

Related: Channel Hardening, Massive MIMO, MRC Combining Vector

Theorem: Favorable Propagation for i.i.d. Rayleigh Fading

Let hk∼CN(0,Ξ²kI)\mathbf{h}_k \sim \mathcal{CN}(\mathbf{0}, \beta_{k}\mathbf{I}) and hj∼CN(0,Ξ²jI)\mathbf{h}_j \sim \mathcal{CN}(\mathbf{0}, \beta_{j}\mathbf{I}) be independent for kβ‰ jk \neq j. Then:

E ⁣[1NthkHhj]=0,\mathbb{E}\!\left[\frac{1}{N_t}\mathbf{h}_k^H\mathbf{h}_j\right] = 0, E ⁣[∣hkHhjNt∣2]=Ξ²k βjNtβ†’0.\mathbb{E}\!\left[\left|\frac{\mathbf{h}_k^H\mathbf{h}_j}{N_t}\right|^2\right] = \frac{\beta_{k}\,\beta_{j}}{N_t} \to 0.

Therefore 1NthkHhj→P0\frac{1}{N_t}\mathbf{h}_k^H\mathbf{h}_j \xrightarrow{P} 0, and i.i.d. Rayleigh fading satisfies favorable propagation.

The inner product hkHhj=βˆ‘i=1Nthk,iβˆ—hj,i\mathbf{h}_k^H\mathbf{h}_j = \sum_{i=1}^{N_t} h_{k,i}^*h_{j,i} is a sum of NtN_t independent zero-mean random variables (since hk\mathbf{h}_k and hj\mathbf{h}_j are independent). The sum divided by NtN_t converges to zero by the law of large numbers.

,

Favorable Propagation Under Spatial Correlation

For spatially correlated channels hk∼CN(0,Rk)\mathbf{h}_k \sim \mathcal{CN}(\mathbf{0}, \mathbf{R}_k), the asymptotic cross-correlation is

1NtE[hkHhj]=0\frac{1}{N_t}\mathbb{E}[\mathbf{h}_k^H\mathbf{h}_j] = 0

(still zero, since hk\mathbf{h}_k and hj\mathbf{h}_j are independent), but the normalized variance of the cross-correlation is now

E ⁣[∣hkHhjNt∣2]=tr(RkRj)Nt2.\mathbb{E}\!\left[\left|\frac{\mathbf{h}_k^H\mathbf{h}_j}{N_t}\right|^2\right] = \frac{\text{tr}(\mathbf{R}_k\mathbf{R}_j)}{N_t^{2}}.

This vanishes (favorable propagation holds) if and only if tr(RkRj)/Nt2β†’0\text{tr}(\mathbf{R}_k\mathbf{R}_j) / N_t^{2} \to 0, which requires Rk\mathbf{R}_k and Rj\mathbf{R}_j to have asymptotically orthogonal eigenspaces. Users served by the same BS must occupy different angular sectors. If two users have nearly identical spatial covariance matrices, their channels remain correlated even with unlimited antennas β€” a key motivation for intelligent user scheduling (Chapter 5).

Example: Favorable Propagation: Numerical Check for Two Users

Two users have i.i.d. Rayleigh fading channels with β1=β2=1\beta_{1} = \beta_{2} = 1. For Nt={4,16,64,256}N_t = \{4, 16, 64, 256\}, compute the expected value of ∣h1Hh2∣2/Nt2|\mathbf{h}_1^H\mathbf{h}_2|^2 / N_t^{2} and verify that it decreases as 1/Nt1/N_t.

Favorable Propagation: ∣hkHhj∣2/Nt2|\mathbf{h}_k^H\mathbf{h}_j|^2 / N_t^2 vs NtN_t

Visualize the decay of the normalized inter-user interference ∣hkHhj∣2/Nt2|\mathbf{h}_k^H\mathbf{h}_j|^2/N_t^{2} as NtN_t increases. Use the correlation slider to explore how spatial correlation slows the decay.

Parameters
0

Common Mistake: Favorable Propagation Is Not the Same as Orthogonal Channels

Mistake:

Conflating favorable propagation (asymptotic) with orthogonality: assuming that in a system with Nt=64N_t = 64 and K=4K = 4, the channel vectors are exactly orthogonal.

Correction:

Favorable propagation is an asymptotic property; at finite NtN_t, the off-diagonal entries of 1NtHHH\frac{1}{N_t}\mathbf{H}^{H}\mathbf{H} are small but nonzero. The residual inter-user interference decreases as 1/Nt1/N_t (from Theorem TFavorable Propagation for i.i.d. Rayleigh Fading). For realistic system analysis at finite NtN_t, this residual must be accounted for β€” see Chapter 4 on achievable rate analysis.

Channel Hardening vs. Favorable Propagation

PropertyChannel HardeningFavorable Propagation
What converges?βˆ₯hkβˆ₯2/Ntβ†’Ξ²k\|\mathbf{h}_k\|^2/N_t \to \beta_k (diagonal)hkHhj/Ntβ†’0\mathbf{h}_k^H\mathbf{h}_j/N_t \to 0 (off-diagonal)
Mathematical mechanismLLN applied to βˆ‘βˆ£hk,i∣2\sum |h_{k,i}|^2LLN applied to βˆ‘hk,iβˆ—hj,i\sum h_{k,i}^* h_{j,i} (zero mean)
Rate of convergence (i.i.d.)Var=Ξ²k2/Nt\text{Var} = \beta_k^2 / N_tE[βˆ£β‹…βˆ£2]=Ξ²kΞ²j/Nt\mathbb{E}[|\cdot|^2] = \beta_k\beta_j/N_t
Fails forRank-1 covariance (pure LoS)Users with identical angular support
Implication for designOpen-loop scheduling, stable QoSMRC achieves near-optimal SINR

Quick Check

Under what condition does favorable propagation fail even as Ntβ†’βˆžN_t \to \infty?

When the SNR is too low

When the two users have covariance matrices with overlapping eigenspaces

When the number of users exceeds the number of antennas

When the path-loss coefficients are different