Blind demixing and deconvolution with noisy data at near optimal rate

Blind demixing and deconvolution refers to the problem of simultaneous deconvolution of several source signals from its noisy superposition. This problem appears, amongst others, in the field of Wireless Communication: Many sensors sporadically communicate only short messages over unknown channels. We show that robust recovery of message and channel vectors can be achieved via convex recovery. This requires that random linear encoding is applied at the devices and that the number of required measurements at the receiver scales essentially with the degrees of freedom of the overall estimation problem. Thus, the scaling is linear in the number of source signals. This significantly improves previous results.