Zobrazeno 1 - 10
of 24
pro vyhledávání: '"Clausius, Jannis"'
To alleviate the suboptimal performance of belief propagation (BP) decoding of short low-density parity-check (LDPC) codes, a plethora of improved decoding algorithms has been proposed over the last two decades. Many of these methods can be described
Externí odkaz:
http://arxiv.org/abs/2410.23980
For asynchronous transmission of short blocks, preambles for packet detection contribute a non-negligible overhead. To reduce the required preamble length, joint detection and decoding (JDD) techniques have been proposed that additionally utilize the
Externí odkaz:
http://arxiv.org/abs/2409.01119
This paper proposes to use graph neural networks (GNNs) for equalization, that can also be used to perform joint equalization and decoding (JED). For equalization, the GNN is build upon the factor graph representations of the channel, while for JED,
Externí odkaz:
http://arxiv.org/abs/2401.16187
Isolated training with Gaussian priors (TGP) of the component autoencoders of turbo-autoencoder architectures enables faster, more consistent training and better generalization to arbitrary decoding iterations than training based on deep unfolding. W
Externí odkaz:
http://arxiv.org/abs/2305.09216
For short-packet, low-latency communications over random access channels, piloting overhead significantly reduces spectral efficiency. Therefore, pilotless systems recently gained attraction. While blind phase estimation algorithms such as Viterbi-Vi
Externí odkaz:
http://arxiv.org/abs/2305.01972
Recently, automorphism ensemble decoding (AED) has drawn research interest as a more computationally efficient alternative to successive cancellation list (SCL) decoding of polar codes. Although AED has demonstrated superior performance for specific
Externí odkaz:
http://arxiv.org/abs/2305.01214
For improving short-length codes, we demonstrate that classic decoders can also be used with real-valued, neural encoders, i.e., deep-learning based codeword sequence generators. Here, the classical decoder can be a valuable tool to gain insights int
Externí odkaz:
http://arxiv.org/abs/2212.10355
It is well known that to fulfill their full potential, the design of polar codes must be tailored to their intended decoding algorithm. While for successive cancellation (SC) decoding, information theoretically optimal constructions are available, th
Externí odkaz:
http://arxiv.org/abs/2211.16010
Autor:
Geiselhart, Marvin, Elkelesh, Ahmed, Clausius, Jannis, Liang, Fei, Xu, Wen, Liang, Jing, Brink, Stephan ten
Finding optimal message quantization is a key requirement for low complexity belief propagation (BP) decoding. To this end, we propose a floating-point surrogate model that imitates quantization effects as additions of uniform noise, whose amplitudes
Externí odkaz:
http://arxiv.org/abs/2208.05186
We propose and practically demonstrate a joint detection and decoding scheme for short-packet wireless communications in scenarios that require to first detect the presence of a message before actually decoding it. For this, we extend the recently pr
Externí odkaz:
http://arxiv.org/abs/2207.05699