Superfast Line Spectral Estimation
arXiv:1705.06073 · doi:10.1109/TSP.2018.2807417
Abstract
A number of recent works have proposed to solve the line spectral estimation problem by applying off-the-grid extensions of sparse estimation techniques. These methods are preferable over classical line spectral estimation algorithms because they inherently estimate the model order. However, they all have computation times which grow at least cubically in the problem size, thus limiting their practical applicability in cases with large dimensions. To alleviate this issue, we propose a low-complexity method for line spectral estimation, which also draws on ideas from sparse estimation. Our method is based on a Bayesian view of the problem. The signal covariance matrix is shown to have Toeplitz structure, allowing superfast Toeplitz inversion to be used. We demonstrate that our method achieves estimation accuracy at least as good as current methods and that it does so while being orders of magnitudes faster.
arXiv comment16 pages, 7 figures, accepted for IEEE Transactions on Signal Processing
References in corpus (3)
Cited by in corpus (10)
- Delay Estimation for Ranging and Localization Using Multiband Channel State Information
- Sequential Detection and Estimation of Multipath Channel Parameters Using Belief Propagation
- An Iterative Receiver for OFDM With Sparsity-Based Parametric Channel Estimation
- Graph-based sequential beamforming
- Variational Inference of Structured Line Spectra Exploiting Group-Sparsity
- Fast Variational Block-Sparse Bayesian Learning
- A Theory of Computational Resolution Limit for Line Spectral Estimation
- Gridless Evolutionary Approach for Line Spectral Estimation with Unknown Model Order
- Grid-less Variational Bayesian Inference of Line Spectral from Quantized Samples
- Cubic NK-SVD: An Algorithm for Designing Parametric Dictionary in Frequency Estimation