. , x N from their circular convolutions y n = w * x n , n = 1, 2, 3, . . . , N. The vector w is assumed to be S-sparse in a known basis that is spread out in the Fourier domain, and each input x n is a member of a known K -dimensional random subspace. We prove that whenever K +S log 2 S L/ log 4 (L N), the problem can be solved effectively by using only the nuclear-norm minimization as the convex relaxation, as long as the inputs are sufficiently diverse and obey N log 2 (L N). By "diverse inputs," we mean that the x n 's belong to different, generic subspaces. To the best of our knowledge, this is the first theoretical result on blind deconvolution where the subspace to which w belongs is not fixed but needs to be determined. We discuss the result in the context of multipath channel estimation in wireless communications. Both the fading coefficients and the delays in the channel impulse response w are unknown. The encoder codes the K -dimensional message vectors randomly and then transmits coded messages x n 's over a fixed channel one after the other. The decoder then discovers all of the messages and the channel response when the number of samples taken for each received message are roughly greater than (K + S log 2 S) log 4 (L N), and the number of messages is roughly at least log 2 (L N). Index Terms-Blind deconvolution, multichannel, passive sensing, matrix factorizations, low-rank matrix, compressed sensing, channel estimation, rank-1 matrix, image deblurring, convex programming, and nuclear norm minimization.
In REF , Ahmed and Demanet leverage multiple diverse inputs -living in known random subspaces -to weaken the assumption on the channel; the subspace in which the channel lives is now also to be discovered.
Leveraging Diversity and Sparsity in Blind Deconvolution
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Mathematics Computer Science