Local search algorithm for low autocorrelation binary sequences

Abstract

LABS (low autocorrelation binary sequence) have many practical applications. In radar application, sequences with low autocorrelation side lobe energies are necessary to reduce the noise and to increase the ability of radars to detect multiple targets. In the literature, several techniques have been proposed to solve the LABS problem. For short length sequences, local search algorithms can be applied as the search space is manageable. For this reason, this article proposes to use two known local search algorithm: TS (tabu search) and SA (simulated annealing). These algorithms were be applied to find an optimal value of the register that generates an MLS sequence. With this implementation, we have obtained better results, we have found a higher value of merit factor compared with without optimization.