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

10/30/2020
by   Janez Brest, et al.
0

In this paper we present best-known merit factors of longer binary sequences with odd length. Finding low autocorrelation binary sequences with optimal merit factors is difficult optimization problem. High performance computations with execution of a stochastic algorithm in parallel, enable us searching skew-symmetric binary sequences with high merit factors. After experimental work, as results we present sequences with odd length between 301 and 401 that are skew-symmetric and have merit factor F greater than 7. Moreover, now all sequences with odd length between 301 and 401 with F > 7 have been found.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/07/2021

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

The merit factor problem is of practical importance to manifold domains,...
research
04/01/2021

A note on Barker sequences of even length

A Barker sequence is a binary sequence for which all nontrivial aperiodi...
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
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/26/2022

A Nonlinear Sum of Squares Search for CAZAC Sequences

We report on a search for CAZAC sequences by using nonlinear sum of squa...
research
06/25/2017

Finding optimal finite biological sequences over finite alphabets: the OptiFin toolbox

In this paper, we present a toolbox for a specific optimization problem ...
research
07/12/2020

Denoising as well as the best of any two denoisers

Given two arbitrary sequences of denoisers for block lengths tending to ...

Please sign up or login with your details

Forgot password? Click here to reset