arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2011.10130math.NAcs.NA
收藏

二元离散傅里叶变换及其逆变换

Binary Discrete Fourier Transform and its Inversion

Howard W. Levinson, Vadim A. Markel

摘要:

长度为$N$的二进制向量的元素为0或1。我们调查的问题,是否以及如何可以从一组有限的离散傅里叶变换(DFT)系数的已知长度的二进制向量的重建。向量是二进制的先验信息提供了强大的约束。我们证明了一个二进制向量是唯一定义的两个复杂的DFT系数(零,这给popcount,和第一),如果$N$是素数。如果$N$有两个素因子,则必须在数据集中包括额外的DFT系数以保证唯一性,并且我们从理论上找到所需系数的数量。可能需要知道更多的DFT系数以保证反演的稳定性。然而,我们的研究结果表明,稳定的反演,可以得到当已知的系数的数量是总的$1/3$。这需要超分辨率的效果(分辨率极限提高了$\sim 3$的因子)。

英文摘要:

A binary vector of length $N$ has elements that are either 0 or 1. We investigate the question of whether and how a binary vector of known length can be reconstructed from a limited set of its discrete Fourier transform (DFT) coefficients. A priori information that the vector is binary provides a powerful constraint. We prove that a binary vector is uniquely defined by its two complex DFT coefficients (zeroth, which gives the popcount, and first) if $N$ is prime. If $N$ has two prime factors, additional DFT coefficients must be included in the data set to guarantee uniqueness, and we find the number of required coefficients theoretically. One may need to know even more DFT coefficients to guarantee stability of inversion. However, our results indicate that stable inversion can be obtained when the number of known coefficients is about $1/3$ of the total. This entails the effect of super-resolution (the resolution limit is improved by the factor of $\sim 3$).

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

↑