An Eigenvector-Based Approach for Multidimensional Frequency Estimation With Improved Identifiability

Authors:
Jun Liu;Xiangqian Liu
Affiliations:
Dept. of Electr. & Comput. Eng., Louisville Univ., KY;-
Venue:
IEEE Transactions on Signal Processing
Year:
2006

Citing 0
Cited 7

Deterministic asymptotic Cramér-Rao bound for the multidimensional harmonic model

Signal Processing
An efficient approach for two-dimensional parameter estimation of a single-tone

IEEE Transactions on Signal Processing
Tensor algebra and multidimensional harmonic retrieval in signal processing for MIMO radar

IEEE Transactions on Signal Processing
Time-varying channel identification and prediction in OFDM systems using 2-D frequency estimation

MILCOM'06 Proceedings of the 2006 IEEE conference on Military communications
Correlation-based algorithm for multi-dimensional single-tone frequency estimation

Signal Processing
Subspace techniques for multidimensional model order selection in colored noise

Signal Processing
Multidimensional prewhitening for enhanced signal reconstruction and parameter estimation in colored noise with Kronecker correlation structure

Signal Processing

Quantified Score

Hi-index	35.69

Visualization

Abstract

This paper presents an algebraic method for two-dimensional (2-D) and multidimensional frequency estimation by exploiting eigenvector structure. The algorithm is based on multidimensional smoothing and data folding, and offers significantly improved identifiability (ID) over existing algebraic approaches, thus is termed the improved multidimensional folding (IMDF) algorithm. The ID, performance, and computational complexity of the proposed algorithm are analyzed in detail. In the 2-D case, it is shown that with the IMDF algorithm, up to approximately 0.34M1(M2+1) 2-D frequencies can be uniquely resolved with probability one from an M1 by M2 data mixture (assuming M1gesM2), while the most relaxed ID bound offered by existing algebraic approaches is approximately M1M2/4. Unlike most eigenvalue techniques that usually require an extra frequency association step, the IMDF algorithm achieves automatic frequency pairing once an eigenvalue decomposition problem is solved because frequencies are estimated from the eigenvectors instead of the eigenvalues. Theoretical analysis and simulation results demonstrate its competitive performance compared to the Crameacuter-Rao bound (CRB)