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

大规模GNSS扩频码优化

Large-Scale GNSS Spreading Code Optimization

Alan Yang, Tara Mina, Stephen Boyd, Grace Gao

AI总结:

针对GNSS等场景的大规模扩频码设计难题,提出比特翻转下降法,通过高效计算比特翻转对相关特性的增量影响、选优翻转来优化扩频码,可快速收敛得到低相关码,为现代及未来卫星导航系统的扩频码开发提供有力工具。

摘要:

我们提出了一种比特翻转下降法,用于优化码族规模大、长度长的二进制扩频码,以解决GNSS及新兴PNT应用中的大规模码设计难题。该方法通过迭代翻转码比特来改善码的自相关和互相关特性。在我们提出的方法中,比特的选择方式是:采样一小部分候选比特,再从中选出能带来最优性能提升的那一个。该方法利用了以下特性:无需重新计算整个函数,就能高效算出比特翻转对自相关和互相关的增量影响。我们将该方法应用于两个参照GPS L1 C/A码和Galileo E1码建模的码设计问题,结果表明它能快速收敛得到低相关码。该方法为开发满足现代及未来卫星导航系统严苛要求的扩频码提供了有力工具。

英文摘要:

We propose a bit-flip descent method for optimizing binary spreading codes with large family sizes and long lengths, addressing the challenges of large-scale code design in GNSS and emerging PNT applications. The method iteratively flips code bits to improve the codes' auto- and cross-correlation properties. In our proposed method, bits are selected by sampling a small set of candidate bits and choosing the one that offers the best improvement in performance. The method leverages the fact that incremental impact of a bit flip on the auto- and cross-correlation may be efficiently computed without recalculating the entire function. We apply this method to two code design problems modeled after the GPS L1 C/A and Galileo E1 codes, demonstrating rapid convergence to low-correlation codes. The proposed approach offers a powerful tool for developing spreading codes that meet the demanding requirements of modern and future satellite navigation systems.

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

↑