The generic crystallographic phase retrieval problem

Abstract: In this paper we consider the problem of recovering a signal

x i n m a t h b b R^{N}

from its power spectrum assuming that the signal is sparse with respect to a generic basis for

m a t h b b R^{N}

. Our main result is that if the sparsity level is at most

s i m! N / 2

in this basis then the generic sparse vector is uniquely determined up to sign from its power spectrum. We also prove that if the sparsity level is

s i m! N / 4

then every sparse vector is determined up to sign from its power spectrum. Analogous results are also obtained for the power spectrum of a vector in

m a t h b b C^{N}

which extend earlier results of Wang and Xu cite{arXiv:1310.0873}.

This page was built for publication: The generic crystallographic phase retrieval problem