Constant Modulus Algorithms via Low-Rank Approximation
Name
CBMM-Memo-077.pdf
Size
795.61 KB
Format
Adobe PDF
Checksum (MD5)
9c6a750873047ade153b86c7aaa6c82c
Author(s)
Adler, Amir
Wax, Mati
Date Issued
April 12, 2018
Publisher
Center for Brains, Minds and Machines (CBMM)
Series/Report no.
CBMM Memo Series;077
Abstract
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. The usefulness of the proposed solutions is demonstrated for the tasks of blind beamforming and blind multiuser detection. The performance of these solutions, as we demonstrate by simulated data, is superior to existing methods.
Subjects
Constant modulus
convex optimization
trace norm
Terms of Use
Attribution-NonCommercial-ShareAlike 3.0 United States
Persistent DSpace Link
