FFT-Enhanced Low-Complexity Near-Field Super-Resolution Sensing
Abstract
In this letter, a fast Fourier transform (FFT)-enhanced low-complexity super-resolution sensing algorithm for near-field source localization with both angle and range estimation is proposed. Most traditional near-field source localization algorithms suffer from excessive computational complexity or incompatibility with existing array architectures. To address such issues, this letter proposes a novel near-field sensing algorithm that combines coarse and fine granularity of spectrum peak search. Specifically, a spectral pattern in the angle domain is first constructed using FFT to identify potential angles where sources are present. Afterwards, a 1D beamforming is performed in the distance domain to obtain potential distance regions. Finally, a refined 2D multiple signal classification (MUSIC) is conducted within each narrowed angle-distance region to estimate the precise location of the sources. Numerical results demonstrate that the proposed algorithm can significantly reduce the computational complexity of 2D spectrum peak searches and achieve target localization with high-resolution.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.