Optimization of Geometric Constellation Shaping for Wiener Phase Noise Channels with Varying Channel Parameters
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.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
End-to-end Optimization of Constellation Shaping for Wiener Phase Noise Channels with a Differentiable Blind Phase Search
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…
Geometric Constellation Shaping with Low-complexity Demappers for Wiener Phase-noise Channels
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 compl…
Geometric Constellation Shaping for Phase-noise Channels Using a Differentiable Blind Phase Search
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 trans…
Joint Optimization of Geometric and Probabilistic Constellation Shaping for OFDM-ISAC Systems
6G communications systems are expected to integrate radar-like sensing capabilities enabling novel use cases. However, integrated sensing and communications (ISAC) introduces a trade-off between communications and sensin…
ISACJoint Learning of Geometric and Probabilistic Constellation Shaping
The choice of constellations largely affects the performance of communication systems. When designing constellations, both the locations and probability of occurrence of the points can be optimized. These approaches are …