Robust Sparse Fourier Transform Based on The Fourier Projection-Slice Theorem
Shaogang Wang, Vishal M. Patel, Athina Petropulu

TL;DR
This paper introduces a robust sparse Fourier transform method based on the Fourier projection-slice theorem, tailored for noisy radar signals with off-grid frequencies, improving accuracy and efficiency in multidimensional signal processing.
Contribution
The paper extends FPS-SFT into a robust version (RFPS-SFT) that effectively handles noisy, off-grid frequencies using windowing and voting-based decoding techniques.
Findings
Achieves lower frequency localization error in noisy conditions.
Reduces frequency leakage below noise level.
Demonstrates improved performance both theoretically and numerically.
Abstract
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 and , respectively, where 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 and computational complexity of for a multidimensional, -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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsSparse and Compressive Sensing Techniques · Radar Systems and Signal Processing · Image and Signal Denoising Methods
