Local search algorithm for low autocorrelation binary sequences

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.

[1]  Dieter Beule,et al.  Evolutionary search for low autocorrelated binary sequences , 1998, IEEE Trans. Evol. Comput..

[2]  Pascal Van Hentenryck,et al.  A Note on Low Autocorrelation Binary Sequences , 2006, CP.

[3]  Marcel J. E. Golay.  A class of finite binary sequences with alternate auto-correlation values equal to zero (Corresp.) , 1972, IEEE Trans. Inf. Theory.

[4]  J. Bernasconi.  Low autocorrelation binary sequences : statistical mechanics and configuration space analysis , 1987 .

[5]  Driss Aboutajdine,et al.  Analysis of the ambiguity function for phase-coded waveforms , 2015, 2015 IEEE/ACS 12th International Conference of Computer Systems and Applications (AICCSA).

[6]  Steven Halim,et al.  Engineering Stochastic Local Search for the Low Autocorrelation Binary Sequence Problem , 2008, CP.

[7]  Steven David Prestwich.  Exploiting relaxation in local search for LABS , 2007, Ann. Oper. Res..

[8]  I. A. Pasha,et al.  Bi-alphabetic pulse compression radar signal design , 2000 .

[9]  Marcel J. E. Golay,et al.  The merit factor of long low autocorrelation binary sequences , 1982, IEEE Trans. Inf. Theory.

[10]  Tom Høholdt,et al.  The Merit Factor Problem for Binary Sequences , 2006, AAECC.

[11]  S. Dreyfus,et al.  Thermodynamical Approach to the Traveling Salesman Problem : An Efficient Simulation Algorithm , 2004 .

[12]  D. V. Sarwate,et al.  Mean-square correlation of shift-register sequences , 1984 .

[13]  Qizhong Wang.  Optimization by simulating molecular evolution , 1987, Biological Cybernetics.

[14]  Jonathan Jedwab,et al.  A Survey of the Merit Factor Problem for Binary Sequences , 2004, SETA.

[15]  MARCEL J. E. GOLAY,et al.  Sieves for low autocorrelation binary sequences , 1977, IEEE Trans. Inf. Theory.

[16]  Carlos Cotta,et al.  Finding low autocorrelation binary sequences with memetic algorithms , 2009, Appl. Soft Comput..

[17]  K. Hoffmann,et al.  Low autocorrelation binary sequences: exact enumeration and optimization by evolutionary strategies , 1992 .

[18]  Leonid Hulianytskyi,et al.  EFFECTIVE ENERGY RECOMPUTATION FOR LOW AUTOCORRELATION BINARY SEQUENCE PROBLEM , 2011 .

[19]  Matthias F. Stallmann,et al.  Reliable Cost Predictions for Finding Optimal Solutions to LABS Problem: Evolutionary and Alternative Algorithms , 2003 .

[20]  Irwin I. Shapiro,et al.  Fourth Test of General Relativity: New Radar Result , 1971 .

[21]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.