Computational Search of Long Skew-symmetric Binary Sequences with High Merit Factors
Loading...
Date
2022-12-20
Authors
Brest, Janez
Bošković, Borko
ORCID
Advisor
Referee
Mark
Journal Title
Journal ISSN
Volume Title
Publisher
Institute of Automation and Computer Science, Brno University of Technology
Altmetrics
Abstract
In this paper, we present a computational search for best-known merit factors of longer binary sequences with an odd length. Finding low autocorrelation binary sequences with optimal or suboptimal merit factors is a very difficult optimization problem. An improved version of the heuristic algorithm is presented and tackled to search for aperiodic binary sequences with good autocorrelation properties. High-performance computations with the execution of our stochastic algorithmto search skew-symmetric binary sequences with high merit factors. After experimental work, as results, we present new binary sequences with odd lengths between 201 and 303 that are skew-symmetric and have the merit factor F greater than 8.5. Moreover, an example of a binary sequence having F > 8 has been found for all odd lengths between 201 and 303. The longest binary sequence with F > 9 found to date is of length 255.
Description
Citation
Mendel. 2022 vol. 28, č. 2, s. 17-24. ISSN 1803-3814
https://mendel-journal.org/index.php/mendel/article/view/189
https://mendel-journal.org/index.php/mendel/article/view/189
Document type
Peer-reviewed
Document version
Published version
Date of access to the full text
Language of document
en
Study field
Comittee
Date of acceptance
Defence
Result of defence
Document licence
Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International license
http://creativecommons.org/licenses/by-nc-sa/4.0
http://creativecommons.org/licenses/by-nc-sa/4.0