dc.contributor.author | Adler, Amir | |
dc.contributor.author | Wax, Mati | |
dc.date.accessioned | 2018-04-12T17:23:48Z | |
dc.date.available | 2018-04-12T17:23:48Z | |
dc.date.issued | 2018-04-12 | |
dc.identifier.uri | http://hdl.handle.net/1721.1/114672 | |
dc.description.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. | en_US |
dc.description.sponsorship | This work was supported by the Center for Brains, Minds and Machines (CBMM), funded by NSF STC award CCF-1231216. | en_US |
dc.language.iso | en_US | en_US |
dc.publisher | Center for Brains, Minds and Machines (CBMM) | en_US |
dc.relation.ispartofseries | CBMM Memo Series;077 | |
dc.rights | Attribution-NonCommercial-ShareAlike 3.0 United States | * |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-sa/3.0/us/ | * |
dc.subject | Constant modulus | en_US |
dc.subject | convex optimization | en_US |
dc.subject | trace norm | en_US |
dc.title | Constant Modulus Algorithms via Low-Rank Approximation | en_US |
dc.type | Technical Report | en_US |
dc.type | Working Paper | en_US |
dc.type | Other | en_US |