A New Approach to Sequence Construction With Good Correlation by Particle Swarm Optimization
Abstract
In this paper, a novel computationally affordable method to generate long binary sequences featuring desired properties is presented, based on the use of a number of shorter non linear binary sub-sequences. The paper shows the relationship of the Auto- and Cross-Correlation (AC, CC) of the generated long binary sequences with the AC and CC of constituent sub-sequences. It is also shown that the starting bit position of sub-sequences has an important role on AC and CC of the generated sequences. To generate the optimal long binary sequence from correlation points of view, Particle Swarm Optimization (PSO) algorithm is employed. All the techniques stated in the literature to improve the PSO are implemented and it is clearly shown that the constriction factor and the variable population size turn out to have a great impact on minimizing the fitness function (RMS of AC) representing the target Correlation properties expected for the resulting long sequence. Possible application scenarios for the long sequences generated by the proposed method are also discussed and evaluated.
Keywords
Auto-Correlation, Cross-Correlation, Particle Swarm Optimization, De Bruijn SequencesThis work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
M. Sarayloo, E. Gambi and S. Spinsante, "A New Approach to Sequence Construction With Good Correlation by Particle Swarm Optimization," in Journal of Communications Software and Systems, vol. 11, no. 3, pp. 127-135, September 2015, doi: 10.24138/jcomss.v11i3.101
@article{sarayloo2015approachsequence, author = {Mahdiyar Sarayloo and Ennio Gambi and Susanna Spinsante}, title = {A New Approach to Sequence Construction With Good Correlation by Particle Swarm Optimization}, journal = {Journal of Communications Software and Systems}, month = {9}, year = {2015}, volume = {11}, number = {3}, pages = {127--135}, doi = {10.24138/jcomss.v11i3.101}, url = {https://doi.org/10.24138/jcomss.v11i3.101} }