Ferkans — Interactive Telecom Tutor

From Fading to Near-Deterministic Channels

In traditional wireless systems, the received signal power fluctuates dramatically with small movements of the user (a phenomenon called fast fading). This forces engineers to use deep coding, powerful error correction, and large link margins. One of the most remarkable properties of massive MIMO is that these fluctuations essentially vanish as $N_t$ grows: the effective channel gain concentrates around its mean. The channel "hardens" — it behaves almost like a deterministic scalar, enabling a much simpler system design.

Definition:
Channel Hardening

For a random channel vector $\mathbf{h} \in \mathbb{C}^{N_t}$ , the channel hardening property holds when the normalized squared norm concentrates around 1 in the sense that

$\frac{\|\mathbf{h}\|^2 / N_t}{\mathbb{E}[\|\mathbf{h}\|^2 / N_t]} \xrightarrow{N_t \to \infty} 1 \quad \text{in mean square.}$

Equivalently, $\frac{1}{N_t}\mathbf{h}^H\mathbf{h} \to \beta$ almost surely, where $\beta = \frac{1}{N_t}\mathbb{E}[\|\mathbf{h}\|^2]$ is the average large-scale fading gain.

A quantitative measure of hardening is the hardening coefficient: $\zeta_k = \frac{\text{Var}\left(\|\mathbf{h}_k\|^2\right)} {\left(\mathbb{E}[\|\mathbf{h}_k\|^2]\right)^2},$ which equals $1/N_t$ for i.i.d. Rayleigh fading and $\text{tr}(\mathbf{R}_k^2) / \text{tr}(\mathbf{R}_k)^2$ in general.

Channel hardening is a manifestation of the law of large numbers: summing $N_t$ independent random gains gives a total that concentrates. For correlated channels, hardening is weaker (the variance decreases more slowly) — quantified in Theorem THardening Coefficient for Spatially Correlated Channels.

,

Channel Hardening

The phenomenon where the normalized channel gain $\|\mathbf{h}\|^2 / \mathbb{E}[\|\mathbf{h}\|^2]$ concentrates around 1 as the number of antennas $N_t \to \infty$ . Enables treating the effective channel as nearly deterministic.

Theorem: Channel Hardening for i.i.d. Rayleigh Fading

Let $\mathbf{h} \sim \mathcal{CN}(\mathbf{0}, \beta\mathbf{I}_{N_t})$ , i.e., i.i.d. Rayleigh fading with path-loss $\beta$ . Then:

Mean: $\mathbb{E}\!\left[\frac{1}{N_t}\|\mathbf{h}\|^2\right] = \beta$ .
Variance: $\text{Var}\!\left[\frac{1}{N_t}\|\mathbf{h}\|^2\right] = \frac{\beta^{2}}{N_t}$ .
Concentration: For any $\epsilon > 0$ , $\Pr\!\left[\left|\frac{\|\mathbf{h}\|^2}{N_t} - \beta\right| > \epsilon\right] \leq \frac{\beta^{2}}{N_t\,\epsilon^2} \to 0.$

Hence $\frac{1}{N_t}\|\mathbf{h}\|^2 \xrightarrow{P} \beta$ as $N_t \to \infty$ .

The squared norm $\|\mathbf{h}\|^2 = \sum_{i=1}^{N_t} |h_i|^2$ is a sum of $N_t$ i.i.d. exponential random variables (the squared magnitudes of complex Gaussian entries). By the law of large numbers, this sum divided by $N_t$ converges to the mean $\beta$ .

Show Hint

Recall that if $h \sim \mathcal{CN}(0, \beta)$ , then $|h|^2 \sim \text{Exp}(\beta)$ .

Compute $\mathbb{E}[|h_i|^2]$ and $\text{Var}[|h_i|^2]$ for a single Rayleigh component.

Apply the variance of a sum of i.i.d. terms, then use Chebyshev to bound the concentration.

Proof

Individual component statistics

For $h_i \sim \mathcal{CN}(0, \beta)$ , let $X_i = |h_i|^2$ . Then $\mathbb{E}[X_i] = \beta$ and $\text{Var}[X_i] = \beta^{2}$ (since $X_i \sim \text{Exp}(\beta)$ and the variance of an exponential with mean $\mu$ is $\mu^2$ ).

Mean and variance of the sum

$\|\mathbf{h}\|^2 = \sum_{i=1}^{N_t} X_i$ . By independence and linearity of expectation: $\mathbb{E}\!\left[\|\mathbf{h}\|^2\right] = N_t\,\beta, \qquad \text{Var}\!\left[\|\mathbf{h}\|^2\right] = N_t\,\beta^{2}.$ Dividing by $N_t$ : $\mathbb{E}\!\left[\frac{\|\mathbf{h}\|^2}{N_t}\right] = \beta$ and $\text{Var}\!\left[\frac{\|\mathbf{h}\|^2}{N_t}\right] = \beta^{2}/N_t$ .

Chebyshev bound

Apply Chebyshev's inequality: $\Pr\!\left[\left|\frac{\|\mathbf{h}\|^2}{N_t} - \beta\right| > \epsilon\right] \leq \frac{\text{Var}\!\left[\|\mathbf{h}\|^2/N_t\right]}{\epsilon^2} = \frac{\beta^{2}}{N_t\,\epsilon^2} \to 0.$ This proves convergence in probability. $\blacksquare$

,

Theorem: Hardening Coefficient for Spatially Correlated Channels

Let $\mathbf{h}_k \sim \mathcal{CN}(\mathbf{0}, \mathbf{R}_k)$ with spatial covariance $\mathbf{R}_k \in \mathbb{C}^{N_t \times N_t}$ , $\text{rank}(\mathbf{R}_k) = r_k$ . The variance of the normalized power is

$\text{Var}\!\left[\frac{\|\mathbf{h}_k\|^2}{N_t}\right] = \frac{\text{tr}(\mathbf{R}_k^2)}{N_t^{2}}.$

The hardening coefficient is $\zeta_k = \text{tr}(\mathbf{R}_k^2) / \text{tr}(\mathbf{R}_k)^2$ . For i.i.d. channels, $\mathbf{R}_k = \beta_{k}\mathbf{I}$ and $\zeta_k = 1/N_t \to 0$ . For a rank-1 channel (line-of-sight), $\mathbf{R}_k = \beta_{k}\mathbf{a}\mathbf{a}^H$ and $\zeta_k = 1$ for all $N_t$ — hardening does not occur for a pure LoS channel.

Hardening requires that the channel has many effective degrees of freedom. A rank-1 covariance means all signal power is concentrated in a single spatial direction — there is only one "independent random variable" regardless of how many antennas are used, so no averaging occurs.

Show Hint

Write $\mathbf{h}_k = \mathbf{R}_k^{1/2}\tilde{\mathbf{h}}_k$ where $\tilde{\mathbf{h}}_k \sim \mathcal{CN}(\mathbf{0}, \mathbf{I})$ .

Then $\|\mathbf{h}_k\|^2 = \tilde{\mathbf{h}}_k^H \mathbf{R}_k \tilde{\mathbf{h}}_k$ — a quadratic form in $\tilde{\mathbf{h}}_k$ .

Use the identity $\text{Var}[\mathbf{x}^H \mathbf{A} \mathbf{x}] = \text{tr}(\mathbf{A}^2) + |\text{tr}(\mathbf{A})|^2$ for $\mathbf{x} \sim \mathcal{CN}(\mathbf{0}, \mathbf{I})$ , zero-mean case simplifies to $\text{tr}(\mathbf{A}^2)$ .

Proof

Quadratic form representation

Write $\mathbf{h}_k = \mathbf{R}_k^{1/2}\tilde{\mathbf{h}}_k$ with $\tilde{\mathbf{h}}_k \sim \mathcal{CN}(\mathbf{0}, \mathbf{I})$ . Then $\|\mathbf{h}_k\|^2 = \tilde{\mathbf{h}}_k^H\mathbf{R}_k\tilde{\mathbf{h}}_k$ .

Variance of quadratic form

For a zero-mean $\mathcal{CN}$ vector, $\mathbb{E}[\mathbf{x}^H\mathbf{A}\mathbf{x}] = \text{tr}(\mathbf{A})$ and $\text{Var}[\mathbf{x}^H\mathbf{A}\mathbf{x}] = \text{tr}(\mathbf{A}^2)$ (for Hermitian $\mathbf{A}$ ). With $\mathbf{A} = \mathbf{R}_k$ : $\text{Var}[\|\mathbf{h}_k\|^2] = \text{tr}(\mathbf{R}_k^2)$ . Dividing by $N_t^{2}$ : $\text{Var}[\|\mathbf{h}_k\|^2/N_t] = \text{tr}(\mathbf{R}_k^2)/N_t^{2}$ .

Special cases

For $\mathbf{R}_k = \beta_{k}\mathbf{I}$ : $\text{tr}(\mathbf{R}_k^2) = N_t\,\beta_{k}^{2}$ , so $\zeta_k = N_t\beta_{k}^{2} / (N_t\,\beta_{k})^2 = 1/N_t \to 0$ . For rank-1 $\mathbf{R}_k = \beta_{k}\mathbf{a}\mathbf{a}^H$ ( $\|\mathbf{a}\|=1$ ): $\text{tr}(\mathbf{R}_k^2) = \beta_{k}^{2}$ , $\text{tr}(\mathbf{R}_k) = \beta_{k}$ , so $\zeta_k = 1$ regardless of $N_t$ . $\blacksquare$

Key Takeaway

Channel hardening replaces coherent fading analysis with deterministic equivalents. When $\|\mathbf{h}_k\|^2 / N_t \approx \beta_{k}$ (deterministic), the effective channel gain is predictable without instantaneous CSI. This enables open-loop operation, simplified scheduling, and reliable quality-of-service guarantees — none of which are possible in small MIMO systems.

Channel Hardening Convergence

Plot the empirical distribution of the normalized channel gain $\|\mathbf{h}\|^2 / (N_t \cdot \beta)$ for varying $N_t$ . Watch the distribution concentrate around 1 as $N_t$ grows.

Parameters

BS Antennas

N_t

64

Channel rank

r

64

Common Mistake: Channel Hardening Does Not Apply to Pure LoS Channels

Mistake:

Assuming that deploying more antennas always hardens the channel, even in scenarios dominated by line-of-sight propagation (e.g., a user directly visible to the BS with no scattering).

Correction:

Hardening requires multiple independent fading paths — the averaging is over independent random variables. A rank-1 spatial covariance (pure LoS) has $\zeta_k = 1$ for all $N_t$ : adding more antennas does not reduce the power variance at all. In practice, mmWave channels often have only a few dominant paths, so their hardening coefficient decreases slowly with $N_t$ compared to rich-scattering sub-6 GHz channels.

⚠️Engineering Note

Exploiting Channel Hardening: Open-Loop Scheduling

Channel hardening enables a significant simplification in system design: since the effective channel gain $\|\mathbf{h}_k\|^2$ is nearly deterministic, the BS can schedule users and allocate resources based on long-term statistics (path-loss, large-scale fading) rather than instantaneous channel state. This reduces the overhead for channel quality indicator (CQI) feedback in the downlink by up to 10x compared to conventional MIMO.

However, the 3GPP NR specification still mandates periodic CSI-RS transmission and CQI reporting, even for massive MIMO configurations, because channel hardening is imperfect at finite $N_t$ and at higher frequency bands.

Practical Constraints

•
5G NR mandates CSI-RS periodicity of 5–640 ms (configurable) regardless of antenna count
•
Open-loop scheduling based on large-scale fading works well for $N_t \geq 64$ at sub-6 GHz
•
At mmWave, channels are spatially sparse (low rank); hardening is partial and beam tracking remains essential

📋 Ref: 3GPP TS 38.214, Section 5.2.1

Quick Check

For i.i.d. Rayleigh fading with $N_t = 100$ antennas and $\beta = 1$ , what is $\text{Var}[\|\mathbf{h}\|^2 / N_t]$ ?

$1$

$1/100$

$1/10000$

$0.01$

Correction:

0.01

From Theorem TChannel Hardening for i.i.d. Rayleigh Fading, $\text{Var}[\|\mathbf{h}\|^2/N_t] = \beta^{2}/N_t = 1/100 = 0.01$ . Note: $1/100$ and $0.01$ are the same number — the correct answer is $\beta^{2}/N_t$ .

Channel Hardening: Normalized Gain Distribution as $N_t$ Grows

The distribution of

\|\mathbf{h}\|^2 / (N_t \cdot \beta)

sweeping from

N_t = 1

to

N_t = 256

. The wide chi-squared distribution at small

N_t

collapses to a near-Dirac spike at 1 as

N_t \to \infty

.

Channel Hardening

From Fading to Near-Deterministic Channels

Definition: Channel Hardening

Channel Hardening

Theorem: Channel Hardening for i.i.d. Rayleigh Fading

Individual component statistics

Mean and variance of the sum

Chebyshev bound

Theorem: Hardening Coefficient for Spatially Correlated Channels

Quadratic form representation

Variance of quadratic form

Special cases

Key Takeaway

Channel Hardening Convergence

Parameters

Common Mistake: Channel Hardening Does Not Apply to Pure LoS Channels

Exploiting Channel Hardening: Open-Loop Scheduling

Quick Check

Channel Hardening: Normalized Gain Distribution as NtN_tNt​ Grows

Definition:
Channel Hardening

Channel Hardening: Normalized Gain Distribution as $N_t$ Grows