Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2510.22608

End-to-end Learning of Probabilistic and Geometric Constellation Shaping with Iterative Receivers

Harindu Jayarathne·Dileepa Marasinghe·Nandana Rajatheva·Matti Latva-aho
View original source ↗Read source document ↗Export metadata ↓

Abstract

An end-to-end learning method for constellation shaping with a shaping-encoder assisted transceiver architecture is presented. The shaping encoder, which produces shaping bits with a higher probability of zeros, is used to produce an efficient symbol probability distribution. Both the probability distribution and the constellation geometry are jointly optimized, using end-to-end learning. Optimized constellations are evaluated using two iterative receiver architectures. Bit error rate (BER) performance gain is quantified against standard amplitude phase-shift keying (APSK) and quadrature amplitude modulation (QAM) constellations. A maximum BER gain of 0.3 dB and 0.15 dB are observed under two receivers for the learned constellations compared to standard APSK or QAM. The basic approach is extended to incorporate the full iterative detection and decoding loop, using the deep unfolding technique. A bit error rate gain of 0.1 dB is observed for the iterative scheme with learned constellations under block fading channel conditions, when compared to standard APSK.

Explore related subjects

cs.ITmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Harindu Jayarathne, Dileepa Marasinghe, Nandana Rajatheva, Matti Latva-aho. 2025-10-26. End-to-end Learning of Probabilistic and Geometric Constellation Shaping with Iterative Receivers. https://arxiv.org/abs/2510.22608

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Fundamental Scaling Laws of Covert Communication in the Presence of Block Fading

Covert communication is the undetected transmission of sensitive information over a communication channel. In wireless communication systems, channel impairments such as signal fading present challenges in the effective implementation and analysis of covert communication systems. This paper generalizes early work in the covert communication field by considering asymptotic results for the number of bits that can be covertly transmitted in $n$ channel uses on a block fading channel. Critical to the investigation is characterizing the performance of optimal detectors at the adversary. Matching achievable and converse results are presented.

cs.IT↗
arXiv2026

Sequence Reconstruction over the Deletion Channel

In this paper, we consider the Levenshtein's sequence reconstruction problem in the case where the transmitted codeword is chosen from $\{0,1\}^n$ and the channel can delete up to $t$ symbols from the transmitted codeword. We determine the minimum number of channel outputs (assuming that they are distinct) required to reconstruct a list of size $\ell-1$ of candidate sequences, one of which corresponds to the original transmitted sequence. More specifically, we determine the maximum possible size of the intersection of $\ell \geq 3$ deletion balls of radius $t$ centered at $x_1, x_2, \dots, x_{\ell}$, where $x_i \in \{0,1\}^n$ for all $i \in \{1,2,\dots,\ell\}$ and $x_i \neq x_j$ for $i \neq j$, with $ n \geq t+\ell-1$ and $t \geq 1$.

cs.IT↗
arXiv2026

A generalization of the map $χ$

The mapping $ χ_n:\mathbb{F}_2^n \to \mathbb{F}_2^n$ defined by $y=χ_n(x)$ with $y_i = x_i + x_{i+1}x_{i+2} + x_{i+2}$, where the indices are computed modulo $n$, has been widely studied for its application in lightweight cryptography. In this paper, we generalize this mapping and completely characterize all these shift-invariant permutations of the form $y_i=x_{i+u}+x_{i+v}(x_{i+w}+a_i)$, where $0\le u, v, w<n$ and $a_i\in \mathbb{F}_2$, $1\le i\le n$.

cs.IT↗