arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1406.5301cs.DScs.AI
收藏

低自相关二元序列:改进的优值因子及其实现的预测

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

University of Maribor(马里博尔大学);NC State University(北卡罗来纳州立大学)

Borko Bošković, Franc Brglez, Janez Brest

摘要:

搜索具有高品质因数的二进制序列,称为低自相关二进制序列($labs$ })问题,代表了一个艰巨的计算挑战。为了减轻问题的计算约束,我们考虑求解器,接受奇数值的序列长度$L$和返回的解决方案,斜对称二进制序列-的结果,不是所有的最佳解决方案在此约束下将是最佳的每个$L$。为了改善这两个,寻找最佳的优点因子$and$的渐近运行时性能,我们仪器三个随机求解器,前两个是国家的最先进的求解器,依赖于模因和禁忌搜索的变体($lssMAts$和$lssRRts$),第三个求解器($lssOrel$)组织搜索作为一个独立的连续的自避免步行段的序列。通过采用严格的统计方法对所有三种组合求解器进行性能测试,实验表明,具有最佳渐近平均情况性能的求解器,$lssOrel\_8 = 0.000032*1.1504^L$,最有可能找到改善的解决方案,随着$L$的增加,迄今为止报道的品质因数。同样的方法可以应用于设计新的$labs$解算器,这些解算器可以返回甚至更接近于所确定的渐近值12.3248的优值因子。

英文摘要:

The search for binary sequences with a high figure of merit, known as the low autocorrelation binary sequence ($labs$}) problem, represents a formidable computational challenge. To mitigate the computational constraints of the problem, we consider solvers that accept odd values of sequence length $L$ and return solutions for skew-symmetric binary sequences only -- with the consequence that not all best solutions under this constraint will be optimal for each $L$. In order to improve both, the search for best merit factor $and$ the asymptotic runtime performance, we instrumented three stochastic solvers, the first two are state-of-the-art solvers that rely on variants of memetic and tabu search ($lssMAts$ and $lssRRts$), the third solver ($lssOrel$) organizes the search as a sequence of independent contiguous self-avoiding walk segments. By adapting a rigorous statistical methodology to performance testing of all three combinatorial solvers, experiments show that the solver with the best asymptotic average-case performance, $lssOrel\_8 = 0.000032*1.1504^L$, has the best chance of finding solutions that improve, as $L$ increases, figures of merit reported to date. The same methodology can be applied to engineering new $labs$ solvers that may return merit factors even closer to the conjectured asymptotic value of 12.3248.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑