On the Sample Complexity of Multichannel Frequency Estimation via Convex Optimization

From MaRDI portal
Publication:5223933

DOI10.1109/TIT.2018.2881113zbMATH Open1431.94027arXiv1712.05674OpenAlexW2963258211WikidataQ128951565 ScholiaQ128951565MaRDI QIDQ5223933FDOQ5223933


Authors: Zai Yang, Jinhui Tang, Y. C. Eldar, Lihua Xie Edit this on Wikidata


Publication date: 19 July 2019

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

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 L channels, order Kleft(logKight)left(1+frac1LlogNight) samples per channel, selected randomly from N equispaced samples, suffice to ensure with high probability exact estimation of K frequencies that are normalized and mutually separated by at least frac4N. Numerical results are provided corroborating our analysis.


Full work available at URL: https://arxiv.org/abs/1712.05674







Cited In (4)





This page was built for publication: On the Sample Complexity of Multichannel Frequency Estimation via Convex Optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5223933)