16 citations · 19 across the 16 of their papers we have counts for
16 papers
Towards a Unified Coding Scheme for 6G
Paul Bezner, Erdem Eray Cil, Jannis Clausius +14
The growing demand for higher data rates necessitates continuous innovations in wireless communication systems, particularly with the emergence of 6G. Channel coding plays a crucia…
Signal Space-Transformed Expectation Propagation for Symbol Detection in ISI Channels
Jannis Clausius, Luca Schmid, Laurent Schmalen +1
Iterative message passing detection based on expectation propagation (EP) has demonstrated near-optimum performance in many signal processing and communication scenarios. The metho…
Joint Detection and Decoding: A Graph Neural Network Approach
Jannis Clausius, Marvin Rübenacke, Daniel Tandler +1
Narrowing the performance gap between optimal and feasible detection in inter-symbol interference (ISI) channels, this paper proposes to use graph neural networks (GNNs) for detect…
A Comparative Study of Ensemble Decoding Methods for Short Length LDPC Codes
Felix Krieg, Jannis Clausius, Marvin Geiselhart +1
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 prop…
Bounds for Joint Detection and Decoding on the Binary-Input AWGN Channel
Simon Obermüller, Jannis Clausius, Marvin Geiselhart +1
For asynchronous transmission of short blocks, preambles for packet detection contribute a non-negligible overhead. To reduce the required preamble length, joint detection and deco…
Graph Neural Network-based Joint Equalization and Decoding
Jannis Clausius, Marvin Geiselhart, Daniel Tandler +1
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…
Component Training of Turbo Autoencoders
Jannis Clausius, Marvin Geiselhart, Stephan ten Brink
Isolated training with Gaussian priors (TGP) of the component autoencoders of turbo-autoencoder architectures enables faster, more consistent training and better generalization to…
Phase-Equivariant Polar Coded Modulation
Marvin Geiselhart, Marc Gauger, Felix Krieg +2
For short-packet, low-latency communications over random access channels, piloting overhead significantly reduces spectral efficiency. Therefore, pilotless systems recently gained…
Rate-Compatible Polar Codes for Automorphism Ensemble Decoding
Marvin Geiselhart, Jannis Clausius, Stephan ten Brink
Recently, automorphism ensemble decoding (AED) has drawn research interest as a more computationally efficient alternative to successive cancellation list (SCL) decoding of polar c…
Optimizing Serially Concatenated Neural Codes with Classical Decoders
Jannis Clausius, Marvin Geiselhart, Stephan ten Brink
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. H…
Graph Search based Polar Code Design
Marvin Geiselhart, Andreas Zunker, Ahmed Elkelesh +2
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) decod…
Learning Quantization in LDPC Decoders
Marvin Geiselhart, Ahmed Elkelesh, Jannis Clausius +4
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 imitate…
Learning Joint Detection, Equalization and Decoding for Short-Packet Communications
Sebastian Dörner, Jannis Clausius, Sebastian Cammerer +1
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 me…
A Polar Subcode Approach to Belief Propagation List Decoding
Marvin Geiselhart, Ahmed Elkelesh, Jannis Clausius +1
Permutation decoding gained recent interest as it can exploit the symmetries of a code in a parallel fashion. Moreover, it has been shown that by viewing permuted polar codes as po…
Automorphism Ensemble Decoding of Quasi-Cyclic LDPC Codes by Breaking Graph Symmetries
Marvin Geiselhart, Moustafa Ebada, Ahmed Elkelesh +2
We consider automorphism ensemble decoding (AED) of quasi-cyclic (QC) low-density parity-check (LDPC) codes. Belief propagation (BP) decoding on the conventional factor graph is eq…
Serial vs. Parallel Turbo-Autoencoders and Accelerated Training for Learned Channel Codes
Jannis Clausius, Sebastian Dörner, Sebastian Cammerer +1
Attracted by its scalability towards practical codeword lengths, we revisit the idea of Turbo-autoencoders for end-to-end learning of PHY-Layer communications. For this, we study t…