Designing Unimodular Codes Via Quadratic Optimization

DOI10.1109/TSP.2013.2296883zbMath1394.94967arXiv1303.0152OpenAlexW1967790992MaRDI QIDQ4579042

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)

Related Items (8)

A Dynamic Smoothing Technique for a Class of Nonsmooth Optimization Problems on Manifolds ⋮ Hermitian completely positive matrices ⋮ 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 ⋮ Tightness of a New and Enhanced Semidefinite Relaxation for MIMO Detection ⋮ Argument division based branch-and-bound algorithm for unit-modulus constrained complex quadratic programming ⋮ Nonconvex Phase Synchronization ⋮ Code design for moving target-detecting radar in nonhomogeneous signal-dependent clutter

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