Abstract

In this paper, we consider the low autocorrelation sequence design problem. We optimize a unified metric over a general constraint set. The unified metric includes the integrated sidelobe level (ISL) and the peak sidelobe level (PSL) as special cases, and the general constraint set contains the unimodular constraint, Peak-to-Average Ratio (PAR) constraint, and similarity constraint, to name a few. The optimization technique we employ is the majorization–minimization (MM) method, which is iterative and enjoys guaranteed convergence to a stationary solution. We carry out the MM method in two stages: in the majorization stage, we propose three majorizing functions: two for the unified metric and one for the ISL metric; in the minimization stage, we give closed-form solutions for algorithmic updates under different constraints. The update step can be implemented with a few Fast Fourier Transformations (FFTs) and/or Inverse FFTs (IFFTs). We also show the connections between the MM and gradient projection method under our algorithmic scheme. Numerical simulations have shown that the proposed MM-based algorithms can produce sequences with low autocorrelation and converge faster than the traditional gradient projection method and the state-of-the-art algorithms.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call