Abstract:In this work, we present an open-source implementation of the enumerative sphere shaping (ESS) algorithm used for probabilistic constellation shaping (PCS). PCS aims at closing the shaping gap caused by using uniformly distributed modulation symbols in channels for which information theory shows non-uniformly distributed signaling to be optimal. ESS is one such PCS algorithm that sets itself apart as it operates on a trellis representation of a subset of the possible symbol sequences. ESS leads to an empirical distribution of the symbols that closely approximates the optimal distribution for the additive white Gaussian noise (AWGN) channel. We provide an open-source implementation of this algorithm in the compiled language Rust, as well as Python bindings with which our Rust code can be called in a regular Python script. We also compare simulation results on the AWGN channel using our implementation with previous works on this topic.
Abstract:The blind phase search (BPS) algorithm for carrier phase estimation is known to have sub-optimal performance for probabilistically shaped constellations. We present a belief propagation based approximate maximum a posteriori carrier phase estimator and compare its performance with the standard and an improved BPS algorithm.
Abstract:The Viterbi & Viterbi (V&V) algorithm is well understood for QPSK and 16-QAM, but modifications are required for higher-order modulation formats. We present an approach to extend the standard V&V algorithm for higher-order modulation formats by modifying the transmit constellation with geometric constellation shaping.
Abstract:As the demand for higher data throughput in coherent optical communication systems increases, we need to find ways to increase capacity in existing and future optical communication links. To address the demand for higher spectral efficiencies, we apply end-to-end optimization for joint geometric and probabilistic constellation shaping in the presence of Wiener phase noise and carrier phase estimation. Our approach follows state-of-the-art bitwise auto-encoders, which require a differentiable implementation of all operations between transmitter and receiver, including the DSP algorithms. In this work, we show how to modify the ubiquitous blind phase search (BPS) algorithm, a popular carrier phase estimation algorithm, to make it differentiable and include it in the end-to-end constellation shaping. By leveraging joint geometric and probabilistic constellation shaping, we are able to obtain a robust and pilot-free modulation scheme improving the performance of 64-ary communication systems by at least 0.1bit/symbol compared to square QAM constellations with neural demappers and by 0.05 bit/symbol compared to previously presented approaches applying only geometric constellation shaping.
Abstract:We show that separating the in-phase and quadrature component in optimized, machine-learning based demappers of optical communications systems with geometric constellation shaping reduces the required computational complexity whilst retaining their good performance.
Abstract:We propose a novel method to optimize the structure of factor graphs for graph-based inference. As an example inference task, we consider symbol detection on linear inter-symbol interference channels. The factor graph framework has the potential to yield low-complexity symbol detectors. However, the sum-product algorithm on cyclic factor graphs is suboptimal and its performance is highly sensitive to the underlying graph. Therefore, we optimize the structure of the underlying factor graphs in an end-to-end manner using machine learning. For that purpose, we transform the structural optimization into a clustering problem of low-degree factor nodes that incorporates the known channel model into the optimization. Furthermore, we study the combination of this approach with neural belief propagation, yielding near-maximum a posteriori symbol detection performance for specific channels.
Abstract:We present a novel method to investigate the effects of varying channel parameters on geometrically shaped constellations for communication systems employing the blind phase search algorithm. We show that introduced asymmetries significantly improve performance if adapted to changing channel parameters.
Abstract:We perform geometric constellation shaping with optimized bit labeling using a binary autoencoder including a differential blind phase search (BPS). Our approach enables full end-to-end training of optical coherent transceivers taking into account the digital signal processing.