Blind Demixing and Deconvolution at Near-Optimal Rate
arXiv:1704.04178
Abstract
We consider simultaneous blind deconvolution of r source signals from their noisy superposition, a problem also referred to blind demixing and deconvolution. This signal processing problem occurs in the context of the Internet of Things where a massive number of sensors sporadically communicate only short messages over unknown channels. We show that robust recovery of message and channel vectors can be achieved via convex optimization when random linear encoding using i.i.d. complex Gaussian matrices is used at the devices and the number of required measurements at the receiver scales with the degrees of freedom of the overall estimation problem. Since the scaling is linear in r our result significantly improves over recent works.
arXiv comment49 pages, 1 figure; v2: a few typos removed
References in corpus (10)
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- Sparsity and Incoherence in Compressive Sampling
- General Deviants: An Analysis of Perturbations in Compressed Sensing
- Self-Calibration and Biconvex Compressive Sensing
- The achievable performance of convex demixing
- Identifiability Scaling Laws in Bilinear Inverse Problems
- A Unified Framework for Identifiability Analysis in Bilinear Inverse Problems with Applications to Subspace and Sparsity Models
- Blind Deconvolution Meets Blind Demixing: Algorithms and Performance Bounds
- RIP-like Properties in Subsampled Blind Deconvolution
- Regularized Gradient Descent: A Nonconvex Recipe for Fast Joint Blind Deconvolution and Demixing