一维非迭代的4型和5型非一致FFT方法
Non-iterative Type 4 and 5 Nonuniform FFT Methods in the One-Dimensional Case
摘要:
所谓的非均匀FFT(NFFT)是一系列算法,用于有效地计算有限长度信号的傅立叶变换,无论时间或频率网格是非均匀间隔的。按照通常的分类,存在五种NFFT类型。类型1和类型2使得分别具有非均匀输入和输出网格的从时域到频域成为可能。类型3允许输入和输出非均匀网格。最后,类型4和类型5是类型1和类型2的逆,并且由于它们涉及迭代法,因此计算成本高。在本文中,我们解决了最后一个缺点,在一维的情况下,提出非迭代类型4和5 NFFT方法,只涉及三个NFFT类型1或2加上一些额外的FFT。该方法是基于利用拉格朗日插值公式的结构。本文包括几个数值例子中,所提出的方法进行了比较高斯消除(GE)和共轭梯度(CG)方法,无论是在舍入误差和计算负担。
英文摘要:
The so-called non-uniform FFT (NFFT) is a family of algorithms for efficiently computing the Fourier transform of finite-length signals, whenever the time or frequency grid is nonuniformly spaced. Following the usual classification, there exist five NFFT types. Types 1 and 2 make it possible to pass from the time to the frequency domain with nonuniform input and output grids respectively. Type 3 allows for both input and output nonuniform grids. Finally, types 4 and 5 are the inverses of types 1 and 2 and are expensive computationally, given that they involve iterative methods. In this paper, we solve this last drawback in the one-dimensional case by presenting non-iterative type 4 and 5 NFFT methods that just involve three NFFTs of types 1 or 2 plus some additional FFTs. The methods are based on exploiting the structure of the Lagrange interpolation formula. The paper includes several numerical examples in which the proposed methods are compared with the Gaussian elimination (GE) and conjugate gradient (CG) methods, both in terms of round-off error and computational burden.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。