arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1401.4269cs.ITmath.IT
收藏

SUPER:有效地消除具有未知相位的稀疏信号

SUPER: Sparse signals with Unknown Phases Efficiently Recovered

Sheng Cai, Mayank Bakshi, Sidharth Jaggi, Minghua Chen

摘要:

假设${\bf x}$是$\mathbb{C}^{n}$中的任意精确$k$ -稀疏向量.我们提出了一类相位测量矩阵$A$在$\mathbb{C}^{m\times n}$,和一个相应的算法,称为SUPER,可以解决${\bf x}$的全球相位从强度测量$|A{\bf x}|$与高概率超过$A$。这里,$|A{\bf x}|$是$A{\bf x}$的分量幅度的矢量。SUPER算法是第一个同时具有以下特性的算法:(a)它只需要${\cal O}(k)$(阶最优)测量,(b)解码的计算复杂度是${\cal O}(k\log k)$(近阶最优)算术运算。

英文摘要:

Suppose ${\bf x}$ is any exactly $k$-sparse vector in $\mathbb{C}^{n}$. We present a class of phase measurement matrix $A$ in $\mathbb{C}^{m\times n}$, and a corresponding algorithm, called SUPER, that can resolve ${\bf x}$ up to a global phase from intensity measurements $|A{\bf x}|$ with high probability over $A$. Here $|A{\bf x}|$ is a vector of component-wise magnitudes of $A{\bf x}$. The SUPER algorithm is the first to simultaneously have the following properties: (a) it requires only ${\cal O}(k)$ (order-optimal) measurements, (b) the computational complexity of decoding is ${\cal O}(k\log k)$ (near order-optimal) arithmetic operations.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑