Low-Complexity Algorithms for Multichannel Spectral Super-Resolution
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.
0
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.