Designing Unimodular Codes Via Quadratic Optimization

DOI10.1109/TSP.2013.2296883MaRDI QIDQ4579042zbMATH OpenOpenAlexFDO

Authors Mojtaba Soltanalian, Petre Stoica

Publication date 22 August 2018

Published in IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1303.0152

Mathematics Subject Classification ID

Quadratic programming (90C20) Other types of codes (94B60)

Abstract: The NP-hard problem of optimizing a quadratic form over the unimodular vector set arises in radar code design scenarios as well as other active sensing and communication applications. To tackle this problem (which we call unimodular quadratic programming (UQP)), several computational approaches are devised and studied. A specialized local optimization scheme for UQP is introduced and shown to yield superior results compared to general local optimization methods. Furthermore, a extbf{m}onotonically extbf{er}ror-bound extbf{i}mproving extbf{t}echnique (MERIT) is proposed to obtain the global optimum or a local optimum of UQP with good sub-optimality guarantees. The provided sub-optimality guarantees are case-dependent and generally outperform the $pi/4$ approximation guarantee of semi-definite relaxation. Several numerical examples are presented to illustrate the performance of the proposed method. The examples show that for cases including several matrix structures used in radar code design, MERIT can solve UQP efficiently in the sense of sub-optimality guarantee and computational time.

Cited in

(12)

• Hermitian completely positive matrices
• Nonconvex phase synchronization
• Quadratic Optimization With Similarity Constraint for Unimodular Sequence Synthesis
• Tightness of a New and Enhanced Semidefinite Relaxation for MIMO Detection
• A Dynamic Smoothing Technique for a Class of Nonsmooth Optimization Problems on Manifolds
• New semidefinite relaxations for a class of complex quadratic programming problems
• A graphic structure based branch-and-bound algorithm for complex quadratic optimization and applications to magnitude least-square problem
• Argument division based branch-and-bound algorithm for unit-modulus constrained complex quadratic programming
• Quadratic convex reformulations for a class of complex quadratic programming problems
• Cuts and semidefinite liftings for the complex cut polytope
• Convergence of the sum-of-squares hierarchy for quadratic optimization over roots-of-unity
• Code design for moving target-detecting radar in nonhomogeneous signal-dependent clutter

This page was built for publication: Designing Unimodular Codes Via Quadratic Optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4579042)