Details

Autor(en) / Beteiligte

• Adler, Amir
• Wax, Mati

Titel

Constant modulus algorithms via low-rank approximation

Ist Teil von

• Signal processing, 2019-07, Vol.160, p.263-270

Ort / Verlag

Elsevier B.V

Erscheinungsjahr

2019

Link zum Volltext

Quelle

Elsevier ScienceDirect Journals

Beschreibungen/Notizen

• •A novel convex-optimization-based low-rank approximation 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, is shown to be superior to existing blind beamforming methods. 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.