20.500.12556/DKUM-93000 Dual-step optimization for binary sequences with high merit factors The problem of finding aperiodic low auto-correlation binary sequences (LABS) presents a significant computational challenge, particularly as the sequence length increases. Such sequences have important applications in communication engineering, physics, chemistry, and cryptography. This paper introduces a dual-step algorithm for long binary sequences with high merit factors. The first step employs a parallel algorithm utilizing skew-symmetry and restriction classes to generate sequence candidates with merit factors above a predefined threshold. The second step uses a priority queue algorithm to refine these candidates further, searching the entire search space unrestrictedly. By combining GPU-based parallel computing and dual-step optimization, our approach has successfully identified best-known binary sequences for all lengths ranging from 450 to 527, with the exception of length 518, where the previous best-known merit factor value was matched with a different sequence. This hybrid method significantly outperforms traditional exhaustive and stochastic search methods, offering an efficient solution for finding long sequences with good merit factors. binary sequences Golay's merit factor autocorrelation algorithms binarna zaporedja Golayev faktor zaslug avtokorelacija algoritmi true true false Elsevier Inc. Angleški jezik Slovenski jezik https://www.sciencedirect.com/science/article/pii/S1051200425003380?via%3Dihub © 2025 The Author(s) Članek v reviji 2025-05-30 11:16:02 2025-05-30 11:16:02 2025-05-31 03:09:14 0000-00-00 00:00:00 2025 0 0 9 str. Vol. 165, [article no.] 105316 Oct. 2025 0000-00-00 Zaloznikova Objavljeno NiDoloceno 0000-00-00 0000-00-00 2025-05-13 004 236425219 10.1016/j.dsp.2025.105316 1095-4333 1-s2.0-S1051200425003380-main.pdf 1-s2.0-S1051200425003380-main.pdf 1 4B68C3C58CA1C5BA79CA17FC2C20134C 0d64838a08230cd1228482fd08d078e039534cb4231108a437df66a6d198d5ed 77590ffa-3d39-11f0-adaa-00155d000105 https://dk.um.si/Dokument.php?lang=slv&id=191533 Fakulteta za elektrotehniko, računalništvo in informatiko 0 0 0