首页> 外文会议>IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing >Greedy phase retrieval with reference points and bounded sparsity
【24h】

Greedy phase retrieval with reference points and bounded sparsity

机译:贪婪的相位检索与参考点和有界稀疏性

获取原文

摘要

The phase retrieval problem of recovering a data vector from the squared magnitude of its Fourier transform in general can not be solved uniquely, since the magnitude of the Fourier transform is invariant to a global phase shift, cyclic spatial shift and the conjugate reversal of the signal. We discuss a method of introducing reference points in the signal to resolve aforementioned ambiguities. After specifying requirements for these reference points we present a modification of the GESPAR algorithm to solve the obtained problem.
机译:从其傅立叶变换的平方幅度恢复数据向量的相位检索问题通常不能唯一解决,因为傅里叶变换的幅度是不变的,以全局相移,循环空间移位和信号的共轭反转。我们讨论了一种在信号中引入参考点来解决上述歧义的方法。在指定这些参考点的要求之后,我们呈现了Gespar算法的修改以解决所获得的问题。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号