Paperlane

no. 16 · Tuesday 17 November 2026

Radar Waveform Design via Convex Semidefinite Relaxation

Samuel Pinilla

math.OC · code

Abstract

The ambiguity function (AF) of a radar waveform describes its ability to resolve targets in range and Doppler. Designing a waveform that attains a prescribed AF magnitude is a phase retrieval problem with four trivial ambiguities, and a time- or band-limited pulse is determined up to these ambiguities by at most three times as many AF samples as it has time samples or frequencies. Existing solvers for the narrowband AF, however, are non-convex: they cannot guarantee that they reach the global minimizer, which is unique only up to the trivial ambiguities, so the recovered pulse depends on the starting point. This letter addresses this gap by lifting the problem to positive semidefinite matrices supported on the pulse band, where each AF sample becomes the magnitude of a linear functional. In the lifted space, recovery is formulated as a convex program, and a dual certificate provides a sufficient condition for exactness. The proposed algorithm, wavex, combines an initialization by relaxed reflections, convex semidefinite surrogate steps, and a local polish. Numerical experiments show that wavex accurately recovers band-limited pulses from complete AFs and from AFs with most of their samples removed, provided the remaining samples determine the pulse, and that its accuracy degrades gracefully as the noise increases. wavex is built on the open-source library invexapi, and the code that reproduces every result is available at https://github.com/samuelpinilla/waveX.

code
github.com/samuelpinilla/waveX
fields
Optimization and Control, Mathematical Physics
pdf ↗ page arXiv:2611.20179 ↗