Searcharxiv⌕ Search

arXiv · 2611.18186

NPU-Accelerated GNSS Signal Acquisition

Abstract

On small single-board computers (SBCs), GNSS signal acquisition is a major CPU load. This paper proposes using the neural processing unit (NPU) of an SBC not for machine learning but as an accelerator for the parallel code search in GNSS signal acquisition. The discrete Fourier transform (DFT) used in acquisition is decomposed by the four-step DFT into matrix products of small DFTs and expressed by $1\times1$ convolutions, element-wise products, and transposes, which NPUs execute efficiently. Furthermore, we propose a method that divides the DFT, the non-coherent integration, and the peak detection between the CPU and the NPU according to the configuration of the NPU (an NPU with its own memory connected via PCIe, or an NPU sharing memory with the CPU). The proposed method is implemented in the open-source software GNSS receiver Pocket SDR and evaluated on a Raspberry Pi 5 combined with the external AX8850 NPU and on the NPU built into the SoC (RK3588) of the ROCK 5C, a small SBC of comparable size. Compared with acquisition by an optimized CPU implementation, the acquisition of short codes on the Raspberry Pi 5 with the AX8850 is 3.0-3.8 times faster. In the evaluation of the whole receiver, the number of tracking channels that reach their first lock within 30 s with the NPU is 1.5 times that with the CPU, and the time until 90% of the channels are locked is reduced from 66 s to 26 s. Furthermore, because the CPU load of acquisition is reduced, the number of tracking channels that can be processed in real time increases from about 175 to about 230. These results show that using the NPU on SBCs with limited CPU resources is effective for achieving both GNSS signal acquisition and tracking. The implementation is publicly available as open source under the name PocketSDR-NPU.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Taro Suzuki. 2026-11-13. NPU-Accelerated GNSS Signal Acquisition. https://searcharxiv.com/abs/2611.18186

Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.

KEEP EXPLORING

Related papers

Human-like Semantic Navigation for Autonomous Driving using Knowledge Representation and Large Language Models

Achieving full automation in self-driving vehicles remains a challenge, especially in dynamic urban environments where navigation requires real-time adaptability. Existing systems struggle to handle navigation plans when faced with unpredictable changes in road layouts, spontaneous detours, or missing map data, due to their heavy reliance on predefined cartographic information. In this work, we explore the use of Large Language Models to generate Answer Set Programming rules by translating informal navigation instructions into structured, logic-based reasoning. ASP provides non-monotonic reasoning, allowing autonomous vehicles to adapt to evolving scenarios without relying on predefined maps. We present an experimental evaluation in which LLMs generate ASP constraints that encode real-world urban driving logic into a formal knowledge representation. By automating the translation of informal navigation instructions into logical rules, our method improves adaptability and explainability in autonomous navigation. Results show that LLM-driven ASP rule generation supports semantic-based decision-making, offering an explainable framework for dynamic navigation planning that aligns closely with how humans communicate navigational intent.

cs.RO↗

InFeR: Informed Failure Resilience in Learned Visual Navigation Control

While imitation learning (IL) has enabled successful visual navigation in many common environments, IL policies are prone to unpredictable failures under out-of-distribution (OOD) scenarios. This necessitates failure-resilient policies, which not only detect failures, but also recognise their sources and recover from them autonomously. We propose InFeR, a general framework for building IL policies with informed failure resilience without failure or recovery demonstrations. Given an IL policy's architecture and training dataset, InFeR retrains a new OOD-aware policy with a latent space structured for OOD failure detection, with a modified objective based on the Variational Information Bottleneck. It applies a visual explainability technique, Grad-CAM, to attribute failures to specific image regions and inform a heuristic policy for recovery. All these are achieved without requiring additional training data. Real-world experiments show that InFeR enables informed failure recovery across two different policy architectures, supporting long-range navigation in complex environments.

cs.RO↗

Delay-Aware Distributed Multi-Robot Motion Planning

This paper examines why distributed optimization degrades when multi-robot systems coordinate under realistic communication delays. Using consensus ADMM as a representative framework for generating collision-free, dynamically feasible motion plans in both trajectory optimization and receding-horizon control settings, we show that delay degrades performance structurally: the consensus and dual updates weight stale and current information identically, so staleness enters the optimizer disguised as genuine disagreement and accumulates through the multipliers. Delay-agnostic adaptation (e.g. residual balancing) inherits this contamination and can perform worse than a fixed penalty. We introduce a Delay-Aware ADMM (DA-ADMM) variant that adapts penalty parameters to real-time delay statistics and re-derives the global consensus update as a delay-weighted average, down-weighting stale information in favor of recent updates. Simulations in 2D and 3D show that DA-ADMM improves robustness, success rate, and solution quality over fixed-parameter, residual-balancing, lower-bound, and fixed-constraint baselines. Degradation is therefore governed not by delay length or frequency, but by the optimizer's ability to reason over the age of the information it receives.

cs.RO↗