Fast and Efficient 2-D and K-D DFT-Based Sinusoidal Frequency Estimation

• Published in: IEEE transactions on signal processing 2022, Vol.70, p.5087-5101
• Main Authors: Solak, Veyis, Aldirmaz-Colak, Sultan, Serbes, Ahmet
• Format: Article
• Language: English
• Subjects: 2-D frequency estimation; Computational efficiency; DFT interpolation; Discrete Fourier transforms; Estimation; Frequency estimation; MSE; Multi-dimensional frequency estimation; Optimized production technology; QSE; Signal processing algorithms; Signal to noise ratio
• ISSN: 1053-587X; 1941-0476
• DOI: 10.1109/TSP.2022.3216929

Frequency estimation of a 2-D complex sinusoid under white Gaussian noise is a significant problem having a wide range of applications from signal processing, radar/sonar to wireless communications. This paper proposes two novel and fast DFT-based algorithms for the frequency estimation of 2-D complex sinusoids. The proposed algorithms employ q-shifted DFT coefficients of the signal that correspond to interpolating the signal by a factor of 1/|q| without actually performing zero-padding, where q\in [-0.5,0.5]. We show that the first algorithm is asymptotically efficient since it achieves the asymptotic Cramér-Rao bound (CRB) when the DFT shift parameter and the number of iterations are selected appropriately for large signal size. We propose strict bounds on the selection of these parameters for overall asymptotic efficiency. Then, based on the first algorithm, we propose a second algorithm which also performs on the CRB for both small and large signal lengths. The total computational cost of both of the proposed algorithms is in the order of \mathcal {O}(N_{1} N_{2} \log N_{1} \log N_{2}), where N_{1} and N_{2} are the size of the signal. Finally, we generalize the second algorithm to K-dimensions, where K is any integer larger than one. Comprehensive simulation results confirm all of our theoretical derivations, and also show that our algorithms outperform existing algorithms.