首页> 外文期刊>IEEE Transactions on Information Theory >Vectorized Hankel Lift: A Convex Approach for Blind Super-Resolution of Point Sources
【24h】

Vectorized Hankel Lift: A Convex Approach for Blind Super-Resolution of Point Sources

机译:Vectorized Hankel Lift: A Convex Approach for Blind Super-Resolution of Point Sources

获取原文
获取原文并翻译 | 示例
           

摘要

We consider the problem of resolving $r$ point sources from $n$ samples at the low end of the spectrum when point spread functions (PSFs) are not known. Assuming that the spectrum samples of the PSFs lie in low dimensional subspace (let $s$ denote the dimension), we can formulate it as a matrix recovery problem, followed by location estimation. By exploiting the low rank structure of the vectorized Hankel matrix associated with the target matrix, a convex approach called Vectorized Hankel Lift is proposed for the matrix recovery. It is shown that $ngtrsim rslog ^{4} n$ samples are sufficient for Vectorized Hankel Lift to achieve the exact recovery. For the location retrieval from the matrix, applying the single snapshot MUSIC method within the vectorized Hankel lift framework corresponds to the spatial smoothing technique proposed to improve the performance of the MMV MUSIC for the direction-of-arrival (DOA) estimation.

著录项

获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号