.png){kind=icon}
.png){kind=icon}
Return
Parallel self-avoiding walks for a low-autocorrelation binary sequences problem
.png){kind=icon}
OA
AI
DOI：10.1016/j.jocs.2024.102260.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
A low-autocorrelation binary sequences problem with a high figure of merit factor represents a formidable computational challenge. An efficient parallel computing algorithm is required to reach the new best-known solutions for this problem. Therefore, we developed the sokol(skew) solver for the skew-symmetric search space. The developed solver takes the advantage of parallel computing on graphics processing units. The solver organized the search process as a sequence of parallel and contiguous self-avoiding walks and achieved a speedup factor of 387 compared with lssOrel, its predecessor. The sokol(skew) solver belongs to stochastic solvers and cannot guarantee the optimality of solutions. To mitigate this problem, we established the predictive model of stopping conditions according to the small instances for which the optimal skew-symmetric solutions are known. With its help and 99% probability, the sokol(skew) solver found all the known and seven new best-known skew-symmetric sequences for odd instances from L = 121 to L = 223. For larger instances, the solver cannot reach 99% probability within our limitations, but it still found several new best-known binary sequences. We also analyzed the trend of the best merit factor values, and it shows that as sequence size increases, the value of the merit factor also increases, and this trend is flatter for larger instances.
Keywords:
Low-autocorrelation binary sequences
Self-avoiding walk
Graphic processor units
High performance computing
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
18.3
Papers:
3.1K
Citations:
4.0K