Research On Sequence And Sequence Pairs Search Algorithm Based On Genetic Tabu Search Algorithm

The best sequence,ideal sequence and the best and optimal and ideal sequence pairs have good correlation and are widely used in various engineering fields such as information encryption,ranging,communication systems,and so on.Therefore,ideal sequences and sequence pairs have always been the focus of scholars’ research in coding theory,information encryption,applied mathematics,ranging,communication systems and other fields.In the study of sequences and sequence pairs,using computers to search for sequences and sequence pairs is a very effective way,so finding efficient search algorithms is particularly important.In this thesis,the author expects to get a new genetic Tabu search algorithm by improving the standard genetic algorithm and the original Tabu search algorithm,and apply it to the search of sequences and sequence pairs.Firstly,an improved genetic algorithm with adaptive characteristics and elite retention strategy is designed based on a simple genetic algorithm,and priority queues are used to optimize the data structure and sorting operations in the algorithm.Secondly,based on the above genetic algorithm and the improved Tabu search algorithm,a new genetic Tabu search algorithm is combined.The convergence of the algorithm was demonstrated using the Markov chain model,and complex functions were used for optimization testing and efficiency analysis,proving that the algorithm can not only converge quickly but also obtain higher quality solutions.Thirdly,the obtained genetic tabu search algorithm is used to search for ideal binary sequences with a sequence length N of 35 to 80,and binary sequences with a length N of35 to 300 that have good aperiodic autocorrelation.Moreover,the search time is greatly reduced while obtaining binary sequences with a smaller aperiodic autocorrelation function than those provided in other literature.Finally,the algorithm is applied to the search of optimal binary sequence pairs,pseudo random binary sequence pairs,and ideal binary sequence pairs with optimal three-level correlation,and the optimal binary sequence pairs are obtained when N is 8and 12,pseudo random binary sequence pairs when N is less than or equal to 21,and binary sequence pairs with optimal three-level correlation when N is less than or equal to32.The algorithm is applied to the search of quaternion sequences,and the best quaternion sequences are also found when N is 2,4,8,and 16,ideal quaternion sequences when N is less than or equal to 36,and quaternion sequences with maximum side peaks of 3 and 4for autocorrelation functions when N is greater than or equal to 30.