pith. sign in

arxiv: 1505.02510 · v3 · pith:XCODON7Wnew · submitted 2015-05-11 · 💻 cs.IT · math.IT

Vandermonde Decomposition of Multilevel Toeplitz Matrices with Application to Multidimensional Super-Resolution

classification 💻 cs.IT math.IT
keywords decompositionestimationfrequencytoeplitzvandermondematricesnumericalalgorithms
0
0 comments X
read the original abstract

The Vandermonde decomposition of Toeplitz matrices, discovered by Carath\'{e}odory and Fej\'{e}r in the 1910s and rediscovered by Pisarenko in the 1970s, forms the basis of modern subspace methods for 1D frequency estimation. Many related numerical tools have also been developed for multidimensional (MD), especially 2D, frequency estimation; however, a fundamental question has remained unresolved as to whether an analog of the Vandermonde decomposition holds for multilevel Toeplitz matrices in the MD case. In this paper, an affirmative answer to this question and a constructive method for finding the decomposition are provided when the matrix rank is lower than the dimension of each Toeplitz block. A numerical method for searching for a decomposition is also proposed when the matrix rank is higher. The new results are applied to studying MD frequency estimation within the recent super-resolution framework. A precise formulation of the atomic $\ell_0$ norm is derived using the Vandermonde decomposition. Practical algorithms for frequency estimation are proposed based on relaxation techniques. Extensive numerical simulations are provided to demonstrate the effectiveness of these algorithms compared to the existing atomic norm and subspace methods.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.