Two-phase Optimization of Binary Sequences with Low Peak Sidelobe Level Value

The search for binary sequences with low paper, we present a computational approach that uses peak sidelobe level value represents a formidable computational a stochastic algorithm. To locate better sequences for this our approach cannot provide optimal solutions but in a problem, we designed a stochastic algorithm that uses reasonable time we can locate optimal or near-optimal two fitness functions. Therefore, our approach is also suitable for of the autocorrelation function has a different impact on solving larger instances of the problem. It is defined with the value of the of length L in our problem is defined as follows: exponent over the autocorrelation function values. The main goal of a binary sequences problem with low peak sidelobe level is to find an optimal sequence that has the minimal PSL value, as shown in Eq. (4). 1 Introduction The binary sequences with low peak sidelobe level value S In this sequences with length L. From Eq. (1) it is evident that the number of sequences with length L is 2 The exhaustive search was also applied under the restriction The remainder of the paper is organized as follows. of m-sequence [7].