Voronoi Constellations for Coherent Fiber-Optic Communication Systems

Doctoral thesis, 2023

The increasing demand for higher data rates is driving the adoption of high-spectral-efficiency (SE) transmission in communication systems. The well-known 1.53 dB gap between Shannon's capacity and the mutual information (MI) of uniform quadrature amplitude modulation (QAM) formats indicates the importance of power efficiency, particularly in high-SE transmission scenarios, such as fiber-optic communication systems and wireless backhaul links. Shaping techniques are the only way to close this gap, by adapting the uniform input distribution to the capacity-achieving distribution. The two categories of shaping are probabilistic shaping (PS) and geometric shaping (GS). Various methods have been proposed for performing PS and GS, each with distinct implementation complexity and performance characteristics. In general, the complexity of these methods grows dramatically with the SE and number of dimensions.

Among different methods, multidimensional Voronoi constellations (VCs) provide a good trade-off between high shaping gains and low-complexity encoding/decoding algorithms due to their nice geometric structures. However, VCs with high shaping gains are usually very large and the huge cardinality makes system analysis and design cumbersome, which motives this thesis.

In this thesis, we develop a set of methods to make VCs applicable to communication systems with a low complexity. The encoding and decoding, labeling, and coded modulation schemes of VCs are investigated. Various system performance metrics including uncoded/coded bit error rate, MI, and generalized mutual information (GMI) are studied and compared with QAM formats for both the additive white Gaussian noise channel and nonlinear fiber channels. We show that the proposed methods preserve high shaping gains of VCs, enabling significant improvements on system performance for high-SE transmission in both the additive white Gaussian noise channel and nonlinear fiber channel. In addition, we propose general algorithms for estimating the MI and GMI, and approximating the log-likelihood ratios in soft-decision forward error correction codes for very large constellations.