Fast Unit-modulus Least Squares with Applications in Beamforming and Phase Retrieval
2016-05
Loading...
View/Download File
Persistent link to this item
Statistics
View StatisticsJournal Title
Journal ISSN
Volume Title
Title
Fast Unit-modulus Least Squares with Applications in Beamforming and Phase Retrieval
Authors
Published Date
2016-05
Publisher
Type
Thesis or Dissertation
Abstract
Unit-modulus Least Squares (ULS) problems arise in many applications, including phase-only beamforming, phase retrieval and radar code design. These problems are NP-hard, so there exist problem instances that we cannot solve efficiently, and whether such solution exists remains elusive. ULS formulations can always be recast as Unit-modulus Quadratic Programs (UQPs), to which Semi-Definite Relaxation (SDR) can be applied, and is often the state-of-the-art approach (e.g., PhaseCut). SDR lifts the problem dimension and requires solving a much larger-scale convex problem, which makes it ill-suited for large-scale ULS/UQP. In this paper, we propose several first-order algorithms that meet or exceed SDR performance in terms of minimizing the cost function, and compare favorably to SDR in terms of runtime complexity. We establish convergence of the proposed first-order algorithms to a KKT point, and we demonstrate their superiority in two applications: beamforming using only phase-shifts, and phase retrieval.
Description
University of Minnesota M.S.E.E. thesis. May 2016. Major: Electrical Engineering. Advisor: Nicholas Sidiropoulos. 1 computer file (PDF); vii, 41 pages.
Related to
Replaces
License
Series/Report Number
Funding information
Isbn identifier
Doi identifier
Previously Published Citation
Suggested citation
Tranter, John. (2016). Fast Unit-modulus Least Squares with Applications in Beamforming and Phase Retrieval. Retrieved from the University Digital Conservancy, https://hdl.handle.net/11299/182098.
Content distributed via the University Digital Conservancy may be subject to additional license and use restrictions applied by the depositor. By using these files, users agree to the Terms of Use. Materials in the UDC may contain content that is disturbing and/or harmful. For more information, please see our statement on harmful content in digital repositories.