The physical layer (PHY) abstraction method follows a two-step approach:
The signal-to-interference-plus-noise
ratio (SINR) that a single codeword experiences across multiple streams,
computed via PostEqualizationSINR, is
aggregated into a single effective SINR value.
The effective SINR is chosen so that, if all subcarriers and streams experienced
it uniformly, the resulting block error rate (BLER) would remain
approximately the same.
The effective SINR is then mapped to a BLER value via
precomputed tables, based on the code block size.
The transport BLER (TBLER) can be finally computed as the probability that at
least one of the code blocks in the transport block is not correctly received.
Next, we formally describe the general principle of effective SINR mapping (ESM)
and the exponential ESM (EESM) model.
We assume the presence of multiple channel “links” \(i=1,\dots,N\), each
characterized by its own \(\mathrm{SINR}_{i}\).
In principle, different codeword symbols can be transmitted on the same link,
meaning they experience the same SINR.
Let \(I(x)\) measure the “quality” of a link with SINR value \(x\),
the exact interpretation of which will be discussed later.
The effective SINR, \(\mathrm{SINR}_{\text{eff}}\), is defined
as the SINR of a single-link channel whose quality matches the average
quality of the multi-link channel:
In the following we outline the derivation of this expression, assuming the
transmission of BPSK (\(\pm 1\)) modulated codewords \(u^A\) and
\(u^B\), with a Hamming distance of \(d\).
Single-link channel. In the basic case with one link (\(N=1\)), each codeword
symbol experiences the same channel gain \(\rho\) and complex noise power
\(N_0\), resulting in the received real signal:
where \(j\) indexes the symbols and \(w_j \sim
\mathcal{N}(0, N_0/2)\) is additive real noise. Hence, the SNR (as well as the SINR, since
interference is not considered) is \(\rho /N_0\).
Codeword \(u^A\) is incorrectly decoded as \(u^B\) when the noise
projected along the direction \(u^A-u^B\) exceeds the half distance
between the two codewords, equal to \(\sqrt{d\rho}\).
Hence, the pairwise error probability \(P^{N=1}(u^A \rightarrow u^B)\) can
be expressed as:
where \(Q(x)\) is the tail distribution function of the standard normal
distribution and the inequality stems from the Chernoff bound \(Q(x) \le
e^{-x^2/2}\), for all \(x\).
Two-link channel. We now assume that each symbol is transmitted through
channel link 1 or
2 with probabilities \(p_1\) and \(p_2\), respectively. Link
\(i=1,2\) is characterized by its channel gain \(\sqrt{\rho_i}\).
Consider two received noiseless codewords \(u^A, u^B\) where
\(\ell_1=\ell\) and \(\ell_2=d-\ell\) symbols experience channel 1 and
2, respectively. Then, their half distance is \(\sqrt{\ell_1 \rho_1 +
\ell_2 \rho_2}\) and the conditioned pairwise error probability equals:
EESM expression. By equating the multi-link pairwise error probability bound (65) with
the analogous single-link expression (62), we recognize that the
multi-link channel is analogous to a single-link channel with SINR:
where \(\mathrm{SINR}_{\mathrm{eff}}^{\mathrm{EESM}}\) is the effective SINR for the
multi-link channel under the EESM model.
If we further assume that all links are equiprobable, i.e., \(p_i=1/N\)
for all \(i\), then we obtain expression (61) with \(\beta=1\).
Note that the introduction of parameter \(\beta\) in (61) is useful
to adapt the EESM formula to different modulation and coding schemes (MCS),
since the argument above holds for BPSK modulation only. Hence, \(\beta\) shall
depend on the used MCS, as shown in [5GLENA].