Low-Complexity Algorithms for Multichannel Spectral Super-Resolution
Preprint
Abstract
This paper studies the problem of multichannel spectral super-resolution with either constant amplitude (CA) or not. We propose two optimization problems based on low-rank Hankel-Toeplitz matrix factorization. The two problems effectively leverage the multichannel and CA structures, while also enabling the design of low-complexity gradient descent algorithms for their solutions. Extensive simulations show the superior performance of the proposed algorithms.Keywords
All Related Versions
This publication has 23 references indexed in Scilit:
- Mathematical foundation of sparsity-based multi-snapshot spectral estimationApplied and Computational Harmonic Analysis, 2024
- Effectiveness of the tail-atomic norm in gridless spectrum estimationApplied and Computational Harmonic Analysis, 2024
- Three More Decades in Array Signal Processing Research: An optimization and structure exploitation perspectiveIEEE Signal Processing Magazine, 2023
- On the Sample Complexity of Multichannel Frequency Estimation via Convex OptimizationIEEE Transactions on Information Theory, 2018
- IVDST: A Fast Algorithm for Atomic Norm Minimization in Line Spectral EstimationIEEE Signal Processing Letters, 2018
- Direction-of-arrival estimation for constant modulus signalsIEEE Transactions on Signal Processing, 1999
- Two decades of array signal processing research: the parametric approachIEEE Signal Processing Magazine, 1996
- An analytical constant modulus algorithmIEEE Transactions on Signal Processing, 1996
- ESPRIT-estimation of signal parameters via rotational invariance techniquesIEEE Transactions on Acoustics, Speech, and Signal Processing, 1989
- Multiple emitter location and signal parameter estimationIEEE Transactions on Antennas and Propagation, 1986