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

k角紧框架的施工

Construction of k-angle tight frames

Somantika Datta, Jesse Oldroyd

摘要:

帧由于其对传输错误的鲁棒性和对噪声的弹性而成为信号处理中的标准工具。等角紧帧(ETF)是特别有用的,并且已经被证明对于在一定数量的擦除下的传输是最佳的。不幸的是,ETF在许多情况下并不存在,而且当它们存在时很难构建。然而,已知d维空间中d+1个向量的ETF总是存在的。本文给出了d维空间中d+1个向量的ETF的显式构造。这种构造适用于真实和复杂的情况,并且比现有的方法更简单。在给定的空间中没有任意大小的ETF导致ETF的泛化。这样做的一种方法是考虑紧框架,其中向量对之间的(锐角)角的集合具有k个不同的值。本文提出了一种紧框架的构造方法,使得对于给定的k值,向量对之间的夹角至多取k个不同的值。这些紧框架可以与正则图和关联方案相关。

英文摘要:

Frames have become standard tools in signal processing due to their robustness to transmission errors and their resilience to noise. Equiangular tight frames (ETFs) are particularly useful and have been shown to be optimal for transmission under a certain number of erasures. Unfortunately, ETFs do not exist in many cases and are hard to construct when they do exist. However, it is known that an ETF of d+1 vectors in a d dimensional space always exists. This paper gives an explicit construction of ETFs of d+1 vectors in a d dimensional space. This construction works for both real and complex cases and is simpler than existing methods. The absence of ETFs of arbitrary sizes in a given space leads to generalizations of ETFs. One way to do so is to consider tight frames where the set of (acute) angles between pairs of vectors has k distinct values. This paper presents a construction of tight frames such that for a given value of k, the angles between pairs of vectors take at most k distinct values. These tight frames can be related to regular graphs and association schemes.

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

↑