A New Approach to Sequence Construction With Good Correlation by Particle Swarm Optimization
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) ofthe generated...
Main Authors: | , , |
---|---|
Format: | Article |
Language: | English |
Published: |
Croatian Communications and Information Society (CCIS)
2015-09-01
|
Series: | Journal of Communications Software and Systems |
Subjects: | |
Online Access: | https://jcomss.fesb.unist.hr/index.php/jcomss/article/view/101 |
id |
doaj-4aca2418e9a8484a9b48fef10f35ddd5 |
---|---|
record_format |
Article |
spelling |
doaj-4aca2418e9a8484a9b48fef10f35ddd52020-11-24T20:41:25ZengCroatian Communications and Information Society (CCIS)Journal of Communications Software and Systems1845-64211846-60792015-09-01113127135A New Approach to Sequence Construction With Good Correlation by Particle Swarm OptimizationMahdiyar SaraylooEnnio GambiSusanna SpinsanteIn 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) ofthe generated long binary sequences with the AC and CC ofconstituent 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 Correlationproperties expected for the resulting long sequence. Possible application scenarios for the long sequences generated by the proposed method are also discussed and evaluated.https://jcomss.fesb.unist.hr/index.php/jcomss/article/view/101Auto-CorrelationCross-CorrelationParticle Swarm OptimizationDe Bruijn Sequences |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Mahdiyar Sarayloo Ennio Gambi Susanna Spinsante |
spellingShingle |
Mahdiyar Sarayloo Ennio Gambi Susanna Spinsante A New Approach to Sequence Construction With Good Correlation by Particle Swarm Optimization Journal of Communications Software and Systems Auto-Correlation Cross-Correlation Particle Swarm Optimization De Bruijn Sequences |
author_facet |
Mahdiyar Sarayloo Ennio Gambi Susanna Spinsante |
author_sort |
Mahdiyar Sarayloo |
title |
A New Approach to Sequence Construction With Good Correlation by Particle Swarm Optimization |
title_short |
A New Approach to Sequence Construction With Good Correlation by Particle Swarm Optimization |
title_full |
A New Approach to Sequence Construction With Good Correlation by Particle Swarm Optimization |
title_fullStr |
A New Approach to Sequence Construction With Good Correlation by Particle Swarm Optimization |
title_full_unstemmed |
A New Approach to Sequence Construction With Good Correlation by Particle Swarm Optimization |
title_sort |
new approach to sequence construction with good correlation by particle swarm optimization |
publisher |
Croatian Communications and Information Society (CCIS) |
series |
Journal of Communications Software and Systems |
issn |
1845-6421 1846-6079 |
publishDate |
2015-09-01 |
description |
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) ofthe generated long binary sequences with the AC and CC ofconstituent 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 Correlationproperties expected for the resulting long sequence. Possible application scenarios for the long sequences generated by the proposed method are also discussed and evaluated. |
topic |
Auto-Correlation Cross-Correlation Particle Swarm Optimization De Bruijn Sequences |
url |
https://jcomss.fesb.unist.hr/index.php/jcomss/article/view/101 |
work_keys_str_mv |
AT mahdiyarsarayloo anewapproachtosequenceconstructionwithgoodcorrelationbyparticleswarmoptimization AT enniogambi anewapproachtosequenceconstructionwithgoodcorrelationbyparticleswarmoptimization AT susannaspinsante anewapproachtosequenceconstructionwithgoodcorrelationbyparticleswarmoptimization AT mahdiyarsarayloo newapproachtosequenceconstructionwithgoodcorrelationbyparticleswarmoptimization AT enniogambi newapproachtosequenceconstructionwithgoodcorrelationbyparticleswarmoptimization AT susannaspinsante newapproachtosequenceconstructionwithgoodcorrelationbyparticleswarmoptimization |
_version_ |
1716825223519535104 |