The recently-emerging compressed sensing (CS) theory makes GNSS signal processing at a sub-Nyquist rate possible if it has a sparse representation in certain domain. The previously proposed code-domain compression acquisition algorithms have high computational complexity and low acquisition accuracy under high dynamic conditions. In this paper, a GNSS signal acquisition algorithm based on two-stage compression of the code-frequency domain is proposed. The algorithm maps the incoming signal of the same interval to multiple carrier frequency bins and overlaps the mapped signal that belongs to the same code phase. Meanwhile, the code domain compression is introduced to the preprocessed signal, replacing circular correlation with compressed reconstruction to obtain Doppler frequency and code phase. Theoretical analyses and simulation results show that the proposed algorithm can improve the frequency search accuracy and reduce the computational complexity by about 50% in high dynamics.

Satellite edge computing (SEC) has garnered significant attention for its potential to deliver services directly to users. However, the uneven distribution of receiving tasks among satellites in the constellation can lead to uneven utilization of computing resources. This paper proposes a task offloading strategy for SEC that aims to minimize the average delay and energy consumption of tasks by assigning them to appropriate satellite nodes. The approach uses Lyapunov optimization to convert the long-term optimization problem with task queue length constraints into an assignment problem within a single time slot and solve it based on the Hungarian algorithm. Experimental simulations have shown that the proposed algorithm performs better than other baseline algorithms.

Due to the sparsity of GNSS signal in the correlation domain, compressed sensing theory is considered to be a promising technology for GNSS signal acquisition. However, the detection probability of the traditional compression acquisition algorithm is low under low signal-to-noise ratio (SNR) conditions. This paper proposes a GNSS compression acquisition algorithm based on sensing matrix optimization. The Frobenius norm of the difference between Gram matrix and an approximate equiangular tight frame (ETF) matrix is taken as the objective function, and the modified conjugate gradient method is adopted to reduce the mutual coherence between the measurement matrix and the sparse basis. Theoretical analysis and simulation results show that the proposed algorithm can significantly improve the detection probability compared with the existing compression acquisition algorithms under the same SNR.