239 citations · 695 across the 67 of their papers we have counts for
56 papers · 1 filter
Bisparse Blind Deconvolution through Hierarchical Sparse Recovery
Axel Flinth, Ingo Roth, Gerhard Wunder
The hierarchical sparsity framework, and in particular the HiHTP algorithm, has been successfully applied to many relevant communication engineering problems recently, particularly…
One-Shot Messaging at Any Load Through Random Sub-Channeling in OFDM
Gerhard Wunder, Axel Flinth, Benedikt Groß
Compressive Sensing has well boosted massive random access protocols over the last decade. In this paper we apply an orthogonal FFT basis as it is used in OFDM, but subdivide its i…
A Reverse Jensen Inequality Result with Application to Mutual Information Estimation
Gerhard Wunder, Benedikt Groß, Rick Fritschek +1
The Jensen inequality is a widely used tool in a multitude of fields, such as for example information theory and machine learning. It can be also used to derive other standard ineq…
Guaranteed blind deconvolution and demixing via hierarchically sparse reconstruction
Axel Flinth, Ingo Roth, Benedikt Groß +2
The blind deconvolution problem amounts to reconstructing both a signal and a filter from the convolution of these two. It constitutes a prominent topic in mathematical and enginee…
Reinforce Security: A Model-Free Approach Towards Secure Wiretap Coding
Rick Fritschek, Rafael F. Schaefer, Gerhard Wunder
The use of deep learning-based techniques for approximating secure encoding functions has attracted considerable interest in wireless communications due to impressive results obtai…
Measure Concentration on the OFDM-based Random Access Channel
Gerhard Wunder, Axel Flinth, Benedikt Groß
It is well known that CS can boost massive random access protocols. Usually, the protocols operate in some overloaded regime where the sparsity can be exploited. In this paper, we…