On the Skew-Symmetric Binary Sequences and the Merit Factor Problem

06/07/2021
by   Miroslav Dimitrov, et al.
0

The merit factor problem is of practical importance to manifold domains, such as digital communications engineering, radars, system modulation, system testing, information theory, physics, chemistry. However, the merit factor problem is referenced as one of the most difficult optimization problems and it was further conjectured that stochastic search procedures will not yield merit factors higher than 5 for long binary sequences (sequences with lengths greater than 200). Some useful mathematical properties related to the flip operation of the skew-symmetric binary sequences are presented in this work. By exploiting those properties, the memory complexity of state-of-the-art stochastic merit factor optimization algorithms could be reduced from O(n^2) to O(n). As a proof of concept, a lightweight stochastic algorithm was constructed, which can optimize pseudo-randomly generated skew-symmetric binary sequences with long lengths (up to 10^5+1) to skew-symmetric binary sequences with a merit factor greater than 5. An approximation of the required time is also provided. The numerical experiments suggest that the algorithm is universal and could be applied to skew-symmetric binary sequences with arbitrary lengths.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/30/2020

In Searching of Long Skew-symmetric Binary Sequences with High Merit Factors

In this paper we present best-known merit factors of longer binary seque...
research
06/24/2022

New Classes of Binary Sequences with High Merit Factor

The Merit Factor (MF) measure was first introduced by Golay in 1972. Seq...
research
05/22/2021

On Symmetric Invertible Binary Pairing Functions

We construct a symmetric invertible binary pairing function F(m,n) on th...
research
06/20/2014

Low-Autocorrelation Binary Sequences: On Improved Merit Factors and Runtime Predictions to Achieve Them

The search for binary sequences with a high figure of merit, known as th...
research
10/28/2022

Parallel Self-Avoiding Walks for a Low-Autocorrelation Binary Sequences Problem

A low-autocorrelation binary sequences problem with a high figure of mer...
research
07/18/2017

A Note on Unconditional Subexponential-time Pseudo-deterministic Algorithms for BPP Search Problems

We show the first unconditional pseudo-determinism result for all of sea...
research
03/18/2020

Progress Extrapolating Algorithmic Learning to Arbitrary Sequence Lengths

Recent neural network models for algorithmic tasks have led to significa...

Please sign up or login with your details

Forgot password? Click here to reset