On Efficient and Low-Complexity Decoding of Binary LDPC-Coded CSK Signals for GNSS Links with Increased Data Rates
| Autor: | Matteo Paonni, Axel Garcia-Pena, Remi Chauvat |
|---|---|
| Přispěvatelé: | Ecole Nationale de l'Aviation Civile (ENAC), Directorate for Space, Security and Migration, European Commission - Joint Research Centre [Ispra] (JRC) |
| Jazyk: | angličtina |
| Rok vydání: | 2020 |
| Předmět: |
Computational complexity theory
Computer science 020208 electrical & electronic engineering 020206 networking & telecommunications 02 engineering and technology Direct-sequence spread spectrum Computer engineering Robustness (computer science) GNSS applications 0202 electrical engineering electronic engineering information engineering Demodulation Low-density parity-check code [SPI.SIGNAL]Engineering Sciences [physics]/Signal and Image processing Decoding methods Phase-shift keying |
| Zdroj: | 2020 IEEE/ION Position, Location and Navigation Symposium (PLANS) PLANS 2020 IEEE/ION Position, Location and Navigation Symposium PLANS 2020 IEEE/ION Position, Location and Navigation Symposium, Apr 2020, Portland, United States. pp.1202-1213 / ISBN 978-1-7281-9446-2, ⟨10.1109/PLANS46316.2020.9110196⟩ PLANS |
| Popis: | International audience; GNSS with high data rate links are of interest to accommodate new needs and applications (e.g. precise positioning, authentication, reduction of TTFFD). In this context, a binary LDPC-coded CSK signal is an attractive candidate to increase data rates with a high data recovery robustness. However, such a proposal requires an increase of receiver's computational complexity with respect to receivers for current coded DSSS/BPSK GNSS links. The computational complexity required for data recovery is analysed in this article and insights on crucial technical choices are given for the reception of binary LDPC-coded CSK signals. CSK demodulation is shown to dominate the overall computational cost and the use of digital chip-matched filtering prior to demodulation is proposed to reduce this cost. In addition, iterative demapping, which is crucial to optimize the power efficiency of binary LDPC-coded CSK links is also shown to have high computational complexity. Therefore, low-complexity iterative demapping strategies are studied and simple yet efficient solutions are proposed. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|