A new approach for long low autocorrelation binary sequence problem using genetic algorithm

Distinguishing reflected waveforms from two separated targets which are very close to each other is an important challenge in radar signal processing. Pulse compression is a technique used for accounting for this problem. There are several methods for compressing such as phase coding waveform and the goal of this paper is finding these optimal codes. In this paper, by combining several contents, a new optimum method based on Genetic algorithm is suggested. This method has low computational operation and its speed is faster than the other ordinary algorithms. This method is belonged to local or partial search methods and has following advantages: 1. It uses branch-and-bound strategy; 2. It´s search logic, avoids codes redundant relative to three PSL-preserving operations and upper order of allomorphic forms of a code; 3. Although it is a partial search method, but it does not involved in local minimums; 4. It can be implemented by a simple scheme for partitioning and parallelizing the search by the fixed upper bound on PSL. 5. By using genetic algorithm, it is possible to optimize found codes by several factors simultaneously included in fitness coefficient like as PSL and Merit Factor, The efficiency and effectiveness of the algorithm is exhibited by resulted for code length 126