Symbol-Level Monte Carlo Simulation

• Symbol-level Monte Carlo simulations are techniques to numerically estimate symbol error rates (SER) by evaluating multidimensional Gaussian integrals over error regions.
• The ALOE method employs multiple importance sampling with truncated Gaussian proposals to focus on critical error events, greatly reducing estimator variance.
• Empirical results demonstrate that ALOE achieves orders-of-magnitude improved accuracy over naive Monte Carlo, especially in high SNR and non-standard lattice constellations.

Symbol-level Monte Carlo simulations are central to the numerical estimation of symbol error rates (SER) in advanced digital communication systems, especially for two-dimensional constellations formed by non-square or hexagonal lattices. Estimating SERs typically requires evaluating multi-dimensional integrals that are intractable analytically, leading to reliance on Monte Carlo (MC) methods. However, standard MC is often computationally inefficient, particularly at high signal-to-noise ratios (SNRs), motivating the adoption of multiple importance sampling (MIS) strategies such as the ALOE (“At Least One rare Event”) technique for vastly accelerating convergence and obtaining unbiased estimates with dramatically less computational effort (Elvira et al., 2019).

1. Mathematical Formulation of Symbol Error Rate Estimation

Let $\{s_1,\dots,s_M\} \subset \mathbb{R}^2$ denote the constellation points, with equal-probability transmission. For a transmitted symbol $s_m$, the received vector under additive white Gaussian noise (AWGN) is $x = s_m + n$, where $n \sim \mathcal{N}(0, \sigma^2 I_2)$. The Voronoi region (decision region) for $s_m$ is given as a convex polytope:

$$R_m = \{ x \in \mathbb{R}^2 : a_{m,k}^T x < \beta_{m,k},\ k=1,\dots,K_m \},$$

which is the intersection of $K_m$ half-spaces. The symbol error probability conditioned on $s_m$ is

$$p_m = P \{ x \notin R_m \mid s_m \} = \int_{\mathbb{R}^2} 1_{\mathbb{R}^2 \setminus R_m}(x)\ \pi_m(x)\ dx,$$

where $\pi_m(x) = \mathcal{N}(x; s_m, \sigma^2 I_2)$ is the Gaussian density. The overall SER is then

$P_e = \frac{1}{M} \sum_{m=1}^M p_m.$

The error region $\mathbb{R}^2 \setminus R_m$ can be written as the union of $K_m$ half-spaces $S_{m,k} = \{ x : a_{m,k}^T x \geq \beta_{m,k} \}$, i.e., $$\mathbb{R}^2 \setminus R_m = \bigcup_{k=1}^{K_m} S_{m,k}$$ (Elvira et al., 2019).

2. Multiple Importance Sampling with the ALOE Technique

ALOE applies multiple importance sampling (MIS) by constructing a proposal distribution as a mixture of $K_m$ components, each focused on a different half-space error event:

$$q_{m,k}(x) = \frac{\pi_m(x)\ 1_{S_{m,k}}(x)}{P_{m,k}},$$

where $$P_{m,k} = \int_{S_{m,k}} \pi_m(x)\ dx = Q\left(\frac{\beta_{m,k} - a_{m,k}^T s_m}{\|a_{m,k}\|\sigma}\right)$$ is a one-dimensional Gaussian tail integral, and $Q(\cdot)$ is the standard Gaussian tail function. Each component receives a mixture weight $\alpha_{m,k} = P_{m,k} / \bar{p}_m$, where $\bar{p}_m = \sum_{k=1}^{K_m} P_{m,k}$ forms a union-bound on $p_m$.

The full proposal for symbol $s_m$ is the mixture

$q_m(x) = \sum_{k=1}^{K_m} \alpha_{m,k} q_{m,k}(x).$

Sampling from this proposal focuses computational effort on the error region, giving rise to much lower estimator variance at high SNR.

3. Algorithmic Steps and Estimator Properties

The ALOE procedure is as follows:

1. Precompute for each facet ($k=1,...,K_m$):
   • Hyperplane normals $a_{m,k}$ and thresholds $\beta_{m,k}$
   • Tail probabilities $P_{m,k}$
   • Mixture weights $\alpha_{m,k}$
2. For each sample ($n=1,...,N$ per symbol $s_m$):
   • Draw $k \sim$ Categorical($\{\alpha_{m,1},...,\alpha_{m,K_m}\}$)
   • Draw $x_n$ from the truncated Gaussian $q_{m,k}(x)$ (sample $x_n$ with $a_{m,k}^T x_n \geq \beta_{m,k}$)
   • Compute $C(x_n)$, the number of half-spaces containing $x_n$
3. Weighted Estimation:

$$\hat p_m^{(MIS)} = \frac{\bar p_m}{N} \sum_{n=1}^N \frac{1}{C(x_n)}$$

This estimator is unbiased, $E[\hat p_m^{(MIS)}]=p_m$. The variance is tightly bounded:

$$\text{Var}[\hat p_m^{(MIS)}] \leq \frac{p_m (\bar p_m - p_m)}{N}.$$

In contrast, naive MC's variance is $(p_m - p_m^2)/N$, with a relative RMSE scaling as $(1/\sqrt{N}) \sqrt{1/p_m - 1}$, implying MC requires $N \approx 1/p_m$ samples for order-one accuracy at low error rates, whereas ALOE’s variance falls rapidly as $\bar{p}_m \to p_m$ at high SNR (Elvira et al., 2019).

4. Comparative Performance and Numerical Results

The method's empirical evaluation uses a 64-point "improper" lattice constellation (circularity $\kappa=0.8$), comparing:

• Naive Monte Carlo (MC) with $N = 1280$
• Single-proposal IS with overdispersed Gaussians of variance $\alpha^2 \sigma^2 I$ for $\alpha \in \{1,1.5,...,5\}$
• ALOE MIS with $N = 1280$

Over 200 independent repetitions and at high $\text{E}_b/N_0$ (e.g., $\text{SER}\approx10^{-6}$), ALOE achieves a relative error $10^4$–$10^5$ times smaller than MC, indicating orders-of-magnitude fewer samples or runtime for the same relative accuracy. While the focus is on non-square lattices, similar gains are observed for hexagonal constellations and square QAM at high SNR, consistent with the underlying theory (Elvira et al., 2019).

5. Extension to General Constellations, Lattices, and Noise Models

ALOE applies to any two-dimensional constellation whose decision region is the complement of a convex polytope, i.e., an intersection of half-spaces. Extension to higher-dimensional lattices (such as those encountered in multiple-input multiple-output—MIMO—antenna arrays) is straightforward: the error region remains a union of half-spaces in $\mathbb{R}^d$, and the proposal mixture generalizes naturally, one truncated Gaussian per facet.

For non-Gaussian noise models (e.g., Laplacian or mixture distributions), the base density $\pi_m(x)$ in the proposal is replaced by the appropriate PDF, with the truncated proposal remaining the "base PDF restricted to $S_{m,k}$." The same MIS bookkeeping applies, though the required tail integrals $P_{m,k}$ must now be evaluated for the new base distribution. As SNR increases, $\bar p_m \rightarrow p_m$ and ALOE’s variance approaches zero, reflecting that most errors occur through the nearest hyperplane. At low SNR, both naive MC and ALOE need only a modest number of samples, so the method is robust across all regimes (Elvira et al., 2019).

6. Principled Advantages and Theoretical Implications

ALOE transforms otherwise intractable two-dimensional SER integrals into the sum over $K$ one-dimensional Gaussian (or more generally, noise-model-specific) tail integrals, using these for both proposal construction and estimator computation. The resulting estimator remains unbiased and its variance is always smaller than, and typically vastly outperforms, naive MC at moderate-to-high SNR. Importantly, by construction, every generated sample lies within the error region, ensuring that no simulated effort is wasted—each sample contributes positively to resolving low-probability error events. These properties indicate that symbol-level MC simulation via ALOE is particularly well-suited to regimes where rare-event analysis is essential, such as in evaluating deep-fade, high-SNR, or high-density lattice communication systems (Elvira et al., 2019).