Blind deconvolution and compressed sensing

In this paper we consider the classical problem of blind deconvolution of multiple signals from its superposition, also called blind demixing and deconvolution. One is given a signal Sri=1 wi × xi = y e RL which is the superposition of r unknown source signals {xi}ri=1 and convolution kernels {wi}ri=1 The goal is to reconstruct the vectors wi and xi, which are elements of known but random subspaces. The problem can be lifted into a low rank matrix recovery problem. We will discuss uniform as well as non-uniform recovery guarantees.