Hans D. Mittelmann

Heuristic methods for designing unimodular code sequences with performance guarantees

We develop polynomial-time heuristic methods to solve unimodular quadratic programming (UQP) approximately, which is known to be NP-hard. In the UQP framework, we maximize a quadratic function of a vector of complex variables with unit modulus. Several problems in active sensing and wireless communi…