11 citations · 11 across the 3 of their papers we have counts for
3 papers
cs.IT2022
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…
cs.IT2016★ 11 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…