Time-of-Arrival Estimation for Integrated Satellite Navigation and Communication Signals
Global navigation satellite systems (GNSSs) are used in numerous fields, but their vulnerability is a global problem that has yet to be solved. A promising way to effectively address this problem is by integrating navigation into emerging dense nongeosynchronous orbit (NGSO) megaconstellations. To m...
Gespeichert in:
Veröffentlicht in: | IEEE transactions on wireless communications 2023-12, Vol.22 (12), p.1-1 |
---|---|
Hauptverfasser: | , , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | Global navigation satellite systems (GNSSs) are used in numerous fields, but their vulnerability is a global problem that has yet to be solved. A promising way to effectively address this problem is by integrating navigation into emerging dense nongeosynchronous orbit (NGSO) megaconstellations. To maximize the downlink efficiency for users, an integrated satellite navigation and communication (ISNAC) framework is proposed in this work, in which a necessary number of packetized bursty downlink satellite communication signals are used directly for navigation purposes. Then, the user terminal estimates the time of arrival (TOA) of these ISNAC signals regardless of their coding and modulation type. To this end, a TOA estimation algorithm is proposed. Specifically, the user terminal first constructs a template signal with demodulated data bits to replicate the transmitted ISNAC signal and then calculates the cross-correlation function (CCF) of the template and the received signal for TOA estimation, based on which the TOA is finally estimated. The performance bound of the proposed TOA estimation algorithm is analyzed. Simulations are conducted to corroborate the mathematical analysis and The results show that the proposed algorithm outperforms other TOA estimators for comparsion by approaching the Cramer-Rao lower bound (CRLB) with a much lower computational complexity. |
---|---|
ISSN: | 1536-1276 1558-2248 |
DOI: | 10.1109/TWC.2023.3274147 |