基于傅里叶投影切片定理的鲁棒稀疏傅里叶变换
Robust Sparse Fourier Transform Based on The Fourier Projection-Slice Theorem
摘要:
最先进的汽车雷达采用多维离散傅里叶变换(DFT)来估计各种目标参数。DFT使用快速傅里叶变换(FFT)来实现,采样复杂度和计算复杂度分别为$O(N)$和$O(N \log N)$,其中$N$是信号空间中的采样数。我们最近提出了一种基于傅立叶投影切片定理(FPS-SFT)的稀疏傅里叶变换,它适用于在频域中稀疏的多维信号。FPS-SFT对于多维、$K$稀疏信号实现了$O(K)$的样本复杂度和$O(K \log K)$的计算复杂度。虽然FPS-SFT考虑了理想场景,即,在本文中,通过将FPS-SFT扩展为鲁棒版本(RFPS-SFT),我们强调解决包含离网频率的噪声信号;这些信号来自雷达应用。这是通过采用窗口技术和基于投票的频率解码过程来实现的;前者将离网频率的频率泄漏降低到低于噪声水平以保持信号的稀疏性,而后者显著降低了源自噪声的频率定位误差。所提出的方法的性能从理论上和数值上证明。
英文摘要:
The state-of-the-art automotive radars employ multidimensional discrete Fourier transforms (DFT) in order to estimate various target parameters. The DFT is implemented using the fast Fourier transform (FFT), at sample and computational complexity of $O(N)$ and $O(N \log N)$, respectively, where $N$ is the number of samples in the signal space. We have recently proposed a sparse Fourier transform based on the Fourier projection-slice theorem (FPS-SFT), which applies to multidimensional signals that are sparse in the frequency domain. FPS-SFT achieves sample complexity of $O(K)$ and computational complexity of $O(K \log K)$ for a multidimensional, $K$-sparse signal. While FPS-SFT considers the ideal scenario, i.e., exactly sparse data that contains on-grid frequencies, in this paper, by extending FPS-SFT into a robust version (RFPS-SFT), we emphasize on addressing noisy signals that contain off-grid frequencies; such signals arise from radar applications. This is achieved by employing a windowing technique and a voting-based frequency decoding procedure; the former reduces the frequency leakage of the off-grid frequencies below the noise level to preserve the sparsity of the signal, while the latter significantly lowers the frequency localization error stemming from the noise. The performance of the proposed method is demonstrated both theoretically and numerically.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。