Designing Low-Correlation GPS Spreading Codes with a Natural Evolution Strategy Machine Learning Algorithm
Not on the map. Why?
Abstract (arXiv)
With the birth of the next-generation GPS III constellation and the upcoming launch of the Navigation Technology Satellite-3 (NTS-3) testing platform to explore future technologies for GPS, we are indeed entering a new era of satellite navigation. Correspondingly, it is time to revisit the design methods of the GPS spreading code families. In this work, we develop a natural evolution strategy (NES) machine learning algorithm with a Gaussian proposal distribution which constructs high-quality families of spreading code sequences. We minimize the maximum between the mean-squared auto-correlation and the mean-squared cross-correlation and demonstrate the ability of our algorithm to achieve better performance than well-chosen families of equal-length Gold codes and Weil codes, for sequences of up to length-1023 and length-1031 bits and family sizes of up to 31 codes. Furthermore, we compare our algorithm with an analogous genetic algorithm implementation assigned the same code evaluation metric. To the best of the authors' knowledge, this is the first work to explore using a machine learning approach for designing navigation spreading code sequences.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 6 of its 57 references that are in the map. First posted on arXiv 8 Jan 2021.
Builds on
6 of 57 references.
References · 6
- 2014Adam: A Method for Stochastic Optimizationcited by 37,240
- 2019Monte Carlo Gradient Estimation in Machine Learningcited by 283
- 2019Parameter Efficient Training of Deep Convolutional Neural Networks by Dynamic Sparse Reparameterizationcited by 189
- 2019A Survey of Optimization Methods from a Machine Learning Perspectivecited by 91
- 2019Low-Memory Neural Network Training: A Technical Reportcited by 57
- 2017AI, Native Supercomputing and The Revival of Moore's Lawcited by 2
Built on by
Not cited yet.