English

On the Sample Complexity of Multichannel Frequency Estimation via Convex Optimization

Information Theory 2018-10-15 v2 math.IT

Abstract

The use of multichannel data in line spectral estimation (or frequency estimation) is common for improving the estimation accuracy in array processing, structural health monitoring, wireless communications, and more. Recently proposed atomic norm methods have attracted considerable attention due to their provable superiority in accuracy, flexibility and robustness compared with conventional approaches. In this paper, we analyze atomic norm minimization for multichannel frequency estimation from noiseless compressive data, showing that the sample size per channel that ensures exact estimation decreases with the increase of the number of channels under mild conditions. In particular, given LL channels, order K(logK)(1+1LlogN)K\left(\log K\right) \left(1+\frac{1}{L}\log N\right) samples per channel, selected randomly from NN equispaced samples, suffice to ensure with high probability exact estimation of KK frequencies that are normalized and mutually separated by at least 4N\frac{4}{N}. Numerical results are provided corroborating our analysis.

Keywords

Cite

@article{arxiv.1712.05674,
  title  = {On the Sample Complexity of Multichannel Frequency Estimation via Convex Optimization},
  author = {Zai Yang and Jinhui Tang and Yonina C. Eldar and Lihua Xie},
  journal= {arXiv preprint arXiv:1712.05674},
  year   = {2018}
}

Comments

14 pages, double column, to appear in IEEE Trans. Information Theory

R2 v1 2026-06-22T23:19:20.231Z