1.3k citations · 1.5k across the 23 of their papers we have counts for
21 papers · 1 filter
Affine symmetries and neural network identifiability
Verner Vlačić, Helmut Bölcskei
We address the following question of neural network identifiability: Suppose we are given a function and a nonlinearity . Can we specify the arch…
Necessary Conditions for K/2 Degrees of Freedom
Recep Gül, Helmut Bölcskei, Shlomo Shamai
Stotz et al., 2016, reported a sufficient (injectivity) condition for each user in a K-user single-antenna constant interference channel to achieve 1/2 degree of freedom. The prese…
Density Criteria for the Identification of Linear Time-Varying Systems
Céline Aubel, Helmut Bölcskei
This paper addresses the problem of identifying a linear time-varying (LTV) system characterized by a (possibly infinite) discrete set of delays and Doppler shifts. We prove that s…
Information-Theoretic Limits of Matrix Completion
Erwin Riegler, David Stotz, Helmut Bölcskei
We propose an information-theoretic framework for matrix completion. The theory goes beyond the low-rank structure and applies to general matrices of "low description complexity".…
Explicit and almost sure conditions for K/2 degrees of freedom
David Stotz, Helmut Bölcskei
It is well known that in K-user constant single-antenna interference channels K/2 degrees of freedom (DoF) can be achieved for almost all channel matrices. Explicit conditions on t…
Almost Lossless Analog Signal Separation
David Stotz, Erwin Riegler, Helmut Bölcskei
We propose an information-theoretic framework for analog signal separation. Specifically, we consider the problem of recovering two analog signals from a noiseless sum of linear me…
Degrees of freedom in vector interference channels
David Stotz, Helmut Bölcskei
This paper continues the Wu-Shamai-Verdu program [3] on characterizing the degrees of freedom (DoF) of interference channels (ICs) through Renyi information dimension. Specifically…
Sparse Signal Recovery in Hilbert Spaces
Graeme Pope, Helmut Bölcskei
This paper reports an effort to consolidate numerous coherence-based sparse signal recovery results available in the literature. We present a single theory that applies to general…
Capacity Pre-Log of Noncoherent SIMO Channels via Hironaka's Theorem
Veniamin I. Morgenshtern, Erwin Riegler, Wei Yang +4
We find the capacity pre-log of a temporally correlated Rayleigh block-fading SIMO channel in the noncoherent setting. It is well known that for block-length L and rank of the chan…
On the Sensitivity of Continuous-Time Noncoherent Fading Channel Capacity
Giuseppe Durisi, Veniamin I. Morgenshtern, Helmut Bölcskei
The noncoherent capacity of stationary discrete-time fading channels is known to be very sensitive to the fine details of the channel model. More specifically, the measure of the s…
Noncoherent SIMO Pre-Log via Resolution of Singularities
Erwin Riegler, Veniamin I. Morgenshtern, Giuseppe Durisi +3
We establish a lower bound on the noncoherent capacity pre-log of a temporally correlated Rayleigh block-fading single-input multiple-output (SIMO) channel. Our result holds for ar…
Uncertainty Relations and Sparse Signal Recovery for Pairs of General Signal Sets
Patrick Kuppinger, Giuseppe Durisi, Helmut Bölcskei
We present an uncertainty relation for the representation of signals in two different general (possibly redundant or incomplete) signal sets. This uncertainty relation is relevant…
Recovery of Sparsely Corrupted Signals
Christoph Studer, Patrick Kuppinger, Graeme Pope +1
We investigate the recovery of signals exhibiting a sparse representation in a general (i.e., possibly redundant or incomplete) dictionary that are corrupted by additive noise admi…
Where is Randomness Needed to Break the Square-Root Bottleneck?
Patrick Kuppinger, Giuseppe Durisi, Helmut Bölcskei
As shown by Tropp, 2008, for the concatenation of two orthonormal bases (ONBs), breaking the square-root bottleneck in compressed sensing does not require randomization over all th…
The SIMO Pre-Log Can Be Larger Than the SISO Pre-Log
Veniamin I. Morgenshtern, Giuseppe Durisi, Helmut Bölcskei
We establish a lower bound on the noncoherent capacity pre-log of a temporally correlated Rayleigh block-fading single-input multiple-output (SIMO) channel. Surprisingly, when the…
Improved Sparsity Thresholds Through Dictionary Splitting
Patrick Kuppinger, Giuseppe Durisi, Helmut Bölcskei
Known sparsity thresholds for basis pursuit to deliver the maximally sparse solution of the compressed sensing recovery problem typically depend on the dictionary's coherence. Whil…
Compressed Sensing of Block-Sparse Signals: Uncertainty Relations and Efficient Recovery
Yonina C. Eldar, Patrick Kuppinger, Helmut Bölcskei
We consider compressed sensing of block-sparse signals, i.e., sparse signals that have nonzero coefficients occurring in clusters. An uncertainty relation for block-sparse signals…
On the Sensitivity of Noncoherent Capacity to the Channel Model
Giuseppe Durisi, Veniamin I. Morgenshtern, Helmut Bölcskei
The noncoherent capacity of stationary discrete-time fading channels is known to be very sensitive to the fine details of the channel model. More specifically, the measure of the s…
Noncoherent Capacity of Underspread Fading Channels
Giuseppe Durisi, Ulrich G. Schuster, Helmut Bölcskei +1
We derive bounds on the noncoherent capacity of wide-sense stationary uncorrelated scattering (WSSUS) channels that are selective both in time and frequency, and are underspread, i…
Distributed Transmit Diversity in Relay Networks
Cemal Akçaba, Patrick Kuppinger, Helmut Bölcskei
We analyze fading relay networks, where a single-antenna source-destination terminal pair communicates through a set of half-duplex single-antenna relays using a two-hop protocol w…
Capacity of Underspread Noncoherent WSSUS Fading Channels under Peak Signal Constraints
Giuseppe Durisi, Helmut Bölcskei, Shlomo Shamai
We characterize the capacity of the general class of noncoherent underspread wide-sense stationary uncorrelated scattering (WSSUS) time-frequency-selective Rayleigh fading channels…