arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2211.00285eess.SP
收藏

基于混合整数二次规划的CDMA应用的二元序列集优化

Binary sequence set optimization for CDMA applications via mixed-integer quadratic programming

Alan Yang, Tara Mina, Grace Gao

摘要:

寻找具有低自相关和互相关特性的二进制序列集是一个具有许多应用的困难的组合优化问题,包括多输入多输出(MIMO)雷达和全球导航卫星系统(GNSS)。平方相关的和,有时被称为综合旁瓣电平(ISL),是变量的四次函数,是序列集质量的常用度量。在本文中,我们表明,ISL最小化问题可以制定为一个混合整数二次规划(MIQP)。然后,我们提出了一个块坐标下降(BCD)算法,迭代优化的变量子集。子集优化子问题也是MIQP,使用专门的求解器比使用穷举搜索可以更有效地处理;这使我们能够在比以前可能的更大的变量子集上执行BCD。我们的方法被用来找到集的四个二进制序列的长度高达1023更好的ISL性能比金码和序列集发现使用现有的BCD方法。

英文摘要:

Finding sets of binary sequences with low auto- and cross-correlation properties is a hard combinatorial optimization problem with numerous applications, including multiple-input-multiple-output (MIMO) radar and global navigation satellite systems (GNSS). The sum of squared correlations, sometimes referred to as the integrated sidelobe level (ISL), is a quartic function in the variables and is a commonly-used metric of sequence set quality. In this paper, we show that the ISL minimization problem may be formulated as a mixed-integer quadratic program (MIQP). We then present a block coordinate descent (BCD) algorithm that iteratively optimizes over subsets of variables. The subset optimization subproblems are also MIQPs which may be handled more efficiently using specialized solvers than using exhaustive search; this allows us to perform BCD over larger variable subsets than previously possible. Our approach was used to find sets of four binary sequences of lengths up to 1023 with better ISL performance than Gold codes and sequence sets found using existing BCD methods.

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

↑