most citedFlexible Length Polar Codes through Graph Based Augmentation

11 citations · 12 across the 5 of their papers we have counts for

collaborators

5 papers

cs.IT20221 cited

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…

cs.IT2022

Graph Neural Networks for Channel Decoding

Sebastian Cammerer, Jakob Hoydis, Fayçal Aït Aoudia +1

In this work, we propose a fully differentiable graph neural network (GNN)-based architecture for channel decoding and showcase a competitive decoding performance for various codin…

cs.IT201611 cited

Flexible Length Polar Codes through Graph Based Augmentation

A. Elkelesh, M. Ebada, S. Cammerer +1

The structure of polar codes inherently requires block lengths to be powers of two. In this paper, we investigate how different block lengths can be realized by coupling of several…

cs.IT2016

Improving Belief Propagation Decoding of Polar Codes Using Scattered EXIT Charts

A. Elkelesh, M. Ebada, S. Cammerer +1

For finite length polar codes, channel polarization leaves a significant number of channels not fully polarized. Adding a Cyclic Redundancy Check (CRC) to better protect informatio…

cs.IT2016

Combining Belief Propagation and Successive Cancellation List Decoding of Polar Codes on a GPU Platform

Sebastian Cammerer, Benedikt Leible, Matthias Stahl +2

The decoding performance of polar codes strongly depends on the decoding algorithm used, while also the decoder throughput and its latency mainly depend on the decoding algorithm.…