Preprint Article Version 1 This version is not peer-reviewed

Rate-Compatible, Bandwidth-Efficient LDPC Codes for Aeronautical Telemetry

Version 1 : Received: 29 October 2024 / Approved: 29 October 2024 / Online: 29 October 2024 (09:23:04 CET)

How to cite: Cummins, A. D.; Mitchell, D. G. M.; Perrins, E. Rate-Compatible, Bandwidth-Efficient LDPC Codes for Aeronautical Telemetry. Preprints 2024, 2024102273. https://doi.org/10.20944/preprints202410.2273.v1 Cummins, A. D.; Mitchell, D. G. M.; Perrins, E. Rate-Compatible, Bandwidth-Efficient LDPC Codes for Aeronautical Telemetry. Preprints 2024, 2024102273. https://doi.org/10.20944/preprints202410.2273.v1

Abstract

Low-density parity-check (LDPC) codes form part of the IRIG-106 standard and have been successfully deployed for the Telemetry Group version of shaped-offset quadrature phase shift keying (SOQPSK-TG) modulation. Recently, LDPC code solutions have been proposed and optimized for continuous phase modulations (CPMs), including pulse code modulation/frequency modulation (PCM/FM) and the multi-h CPM developed by the Advanced Range TeleMetry program (ARTM CPM). These codes were shown to perform around one dB from the respective channel capacities of these modulations. In this paper, we consider the effect of random puncturing and shortening of these LDPC codes to further improve spectrum efficiency. We perform asymptotic analyses of the ARTM0 code ensembles and present numerical simulation results that affirm the robust decoding performance promised by LDPC codes designed for ARTM CPM.

Keywords

FEC; LDPC codes; telemetry; avionics; IRIG; spectral efficiency; puncturing; shortening; iterative decoding

Subject

Engineering, Aerospace Engineering

Comments (0)

We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.

Leave a public comment
Send a private comment to the author(s)
* All users must log in before leaving a comment
Views 0
Downloads 0
Comments 0


×
Alerts
Notify me about updates to this article or when a peer-reviewed version is published.
We use cookies on our website to ensure you get the best experience.
Read more about our cookies here.