最佳复对跖球码的快速近似构造
Fast Approximate Construction of Best Complex Antipodal Spherical Codes
摘要:
压缩感知(CS)理论指出,现实世界的信号通常可以从比香农采样定理所建议的测量少得多的测量中恢复。然而,可恢复性不仅取决于信号,还取决于测量方案。测量矩阵应尽可能接近感兴趣信号的等距。因此,对大小为$m\times n$的最佳CS测量矩阵的搜索转化为对具有最小相干性的一组$n$ $m$维向量的搜索。已知最佳复对映球码(BCASC)在相干性方面是最佳的。最近提出了一种BCASC生成的迭代算法,该算法紧密接近相干性的理论下限。不幸的是,每次迭代的复杂度二次依赖于$m$和$n$。在这项工作中,我们提出了一个修改的算法,允许减少二次的复杂性,以线性的$m$和$n$。数值计算表明,该方法不会恶化的一致性所产生的BCASC。相反,观察到大$n$的改善。计算复杂性的降低为在具有大$n$的问题中使用BCASC作为CS测量矩阵铺平了道路。我们评估的CS性能的BCASC恢复稀疏信号。的BCASC表现优于复杂的随机矩阵和傅立叶系综CS测量矩阵,无论是在相干性和稀疏恢复性能,特别是对于低$m/n$,这是感兴趣的情况下,在CS。
英文摘要:
Compressive Sensing (CS) theory states that real-world signals can often be recovered from much fewer measurements than those suggested by the Shannon sampling theorem. Nevertheless, recoverability does not only depend on the signal, but also on the measurement scheme. The measurement matrix should behave as close as possible to an isometry for the signals of interest. Therefore the search for optimal CS measurement matrices of size $m\times n$ translates into the search for a set of $n$ $m$-dimensional vectors with minimal coherence. Best Complex Antipodal Spherical Codes (BCASCs) are known to be optimal in terms of coherence. An iterative algorithm for BCASC generation has been recently proposed that tightly approaches the theoretical lower bound on coherence. Unfortunately, the complexity of each iteration depends quadratically on $m$ and $n$. In this work we propose a modification of the algorithm that allows reducing the quadratic complexity to linear on both $m$ and $n$. Numerical evaluation showed that the proposed approach does not worsen the coherence of the resulting BCASCs. On the contrary, an improvement was observed for large $n$. The reduction of the computational complexity paves the way for using the BCASCs as CS measurement matrices in problems with large $n$. We evaluate the CS performance of the BCASCs for recovering sparse signals. The BCASCs are shown to outperform both complex random matrices and Fourier ensembles as CS measurement matrices, both in terms of coherence and sparse recovery performance, especially for low $m/n$, which is the case of interest in CS.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。