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

相干优化与最佳复对映球码

Coherence Optimization and Best Complex Antipodal Spherical Codes

Henning Zörlein, Martin Bossert

摘要:

根据Welch界,具有最佳相干性的向量集不可能对所有维数和基数对都存在。如果存在这样一个最优向量集,则它是一个等角紧框架,并表示格拉斯曼线填充问题的解。最佳复对映球码是关于相干性的最佳矢量集。通过扩展用于在实值欧氏空间中找到最佳球形码的方法,所提出的方法旨在找到BCASC,从而找到具有最小相干性的复值向量集。有许多应用需要具有低相干性的向量集。示例不限于无线通信中的若干技术或压缩感测领域。在这方面的贡献,现有的分析和数值方法的相干优化复值向量空间进行了总结和比较所提出的方法。数值获得的相干值改善以前报道的结果。增加计算工作量的缺点得到解决,并提出了一个更快的近似,这可能是一种替代的时间关键的情况下。

英文摘要:

Vector sets with optimal coherence according to the Welch bound cannot exist for all pairs of dimension and cardinality. If such an optimal vector set exists, it is an equiangular tight frame and represents the solution to a Grassmannian line packing problem. Best Complex Antipodal Spherical Codes (BCASCs) are the best vector sets with respect to the coherence. By extending methods used to find best spherical codes in the real-valued Euclidean space, the proposed approach aims to find BCASCs, and thereby, a complex-valued vector set with minimal coherence. There are many applications demanding vector sets with low coherence. Examples are not limited to several techniques in wireless communication or to the field of compressed sensing. Within this contribution, existing analytical and numerical approaches for coherence optimization of complex-valued vector spaces are summarized and compared to the proposed approach. The numerically obtained coherence values improve previously reported results. The drawback of increased computational effort is addressed and a faster approximation is proposed which may be an alternative for time critical cases.

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

↑