.png){kind=icon}
返回
Constant modulus algorithms via low-rank approximation
.png){kind=icon}
OA
AI
DOI：10.1016/j.sigpro.2019.02.007.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We present a novel convex-optimization-based approach to the solutions of a family of problems involving constant modulus signals. The family of problems includes the constant modulus and the constrained constant modulus, as well as the modified constant modulus and the constrained modified constant modulus. These solutions are shown to constitute semidefinite programs (SDP), thus enabling efficient interior-point methods with polynomial time complexity. The performance of the proposed solutions, demonstrated in several simulated experiments for the task of blind beamforming, is shown to be superior to existing methods. (C) 2019 Elsevier B.V. All rights reserved.
Keyword:
Constant modulus
Constrained constant modulus
Modified constant modulus
Multimodulus
Constrained modified constant modulus
Convex optimization
Trace norm
Low rank approximation
Blind beamforming
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.6
论文数:
9.9K
被引数:
1.7W
机构
引用论文
.png){kind=icon}
Phenotypic Heterogeneity in Two Unrelated Danon Patients Associated with the SameLAMP‐2Gene Mutation
PREAI
分享收藏Constant Modulus Blind Adaptive Beamforming Based on Unscented Kalman Filtering基于无迹卡尔曼滤波的恒模盲自适应波束形成
PREAI
分享收藏Long-Term Load Forecasting Approach Using Dynamic Feed-Forward Back-Propagation Artificial Neural Network基于动态前馈-反向传播人工神经网络的长期负荷预测方法
PREAI
分享收藏
查看更多内容