Searcharxiv⌕ Search

arXiv subjects

Rebecca Giuliani

Publications and source records attributed to Rebecca Giuliani.

3 recordsLinked to original sources

Analysis and Design of Spatially Coupled LDPC Codes for Pulsed-Jamming-Resilient Space Telemetry

Jamming is a major threat to space telemetry downlinks, which operate under severe power and bandwidth constraints. This paper develops a jamming-aware analysis and design framework for protograph-based spatially coupled low-density parity-check (SC-LDPC) codes. For pulsed jamming with jamming state information (JSI) at the receiver, we derive a two-state protograph-based extrinsic information transfer (PEXIT) recursion that tracks the messages originating from clean and jammed symbols separately and merges them at the check nodes through a mutual-information-matched Gaussian approximation. For non-interleaved pulsed jamming, we map each pulse realization, through the serialization of the lifted codeword, to a profile of jammed fractions over the variable-node types, and we prove that, under random lifting, this profile determines the local channel-state statistics. The resulting position-dependent thresholds are the objective of a constrained differential-evolution search over protographs, coupling memories, and edge spreadings. At different code rates, the designed ensembles are compared with the Consultative Committee for Space Data Systems (CCSDS) accumulate, repeat-by-4, and jagged accumulate (AR4JA) LDPC codes whose block length matches the SC-LDPC constraint length, with longer AR4JA codes whose block length is comparable with the size of the sliding window decoder, and with non-optimized SC-LDPC codes. Under pulsed jamming with random pulse positions and with JSI, the ensembles designed over random pulse realizations, decoded through sliding window decoding, reach a bit error rate of $10^{-4}$ at lower signal-to-noise ratios than all the benchmarks.

cs.IT↗

Design and Analysis of the Tail Sequence for Short LDPC-Coded Space Communications

According to some standards for satellite communications, the transmitted stream is divided into transmission units with variable length, for which detecting the termination is particularly relevant. This is the case of space TeleCommands (TCs), where coded data are usually preceded by a start sequence, and optionally followed by a tail sequence, forming the Communication Link Transmission Unit (CLTU). Regarding the choice of schemes for error correction, the Consultative Committee for Space Data Systems recommendations for TC synchronization and coding suggests to use, among others, two Low-Density Parity-Check (LDPC) codes: one (relatively) long and one short. Adopting the long LDPC code eliminates the need for a tail sequence, as the LDPC decoder always fails when overrunning the end of the CLTU, thus causing the decoding and detection process to stop. This, however, is not true when the short LDPC code is adopted, since its decoding might converge on a codeword even when the decoder input is not a noisy codeword. This makes it necessary to use a tail sequence that causes the decoder to fail regardless of its input. In this paper, we study the features required for such a sequence and propose some methods for its design. Our numerical results, obtained considering various detection approaches for the tail sequence, show that the overall TC rejection probability improves significantly when the proposed tail sequence is employed. Our simulations also show that, for moderate values of the Signal-to-Noise Ratio (SNR), with a properly designed tail sequence it is possible to obtain the same performance in terms of TC rejection probability using decoder-based detection and likelihood ratio test-based detection, with the former approach being less complex than the latter.

cs.IT↗

Telecommand Rejection Probability for CCSDS-compliant LDPC-Coded Transmissions with Tail Sequence

According to the Consultative Committee for Space Data Systems (CCSDS) recommendation for TeleCommand (TC) synchronization and coding, the Communications Link Transmission Unit (CLTU) consists of a start sequence, followed by coded data, and a tail sequence, which might be optional depending on the employed coding scheme. With regard to the latter, these transmissions traditionally use a modified Bose-Chaudhuri-Hocquenghem (BCH) code, to which two state-of-the-art Low-Density Parity-Check (LDPC) codes were later added. As a lightweight technique to detect the presence of the tail sequence, an approach based on decoding failure has traditionally been used, choosing a non-correctable string as the tail sequence. This works very well with the BCH code, for which bounded-distance decoders are employed. When the same approach is employed with LDPC codes, it is necessary to design the tail sequence as a non-correctable string for the case of iterative decoders based on belief propagation. Moreover, the tail sequence might be corrupted by noise, potentially converting it into a correctable pattern. It is therefore important that the tail sequence is chosen to be as much distant as possible, according to some metric, from any legitimate codeword. In this paper we study such problem, and analyze the TC rejection probability both theoretically and through simulations. Such a performance figure, being the rate at which the CLTU is discarded, should clearly be minimized. Our analysis is performed considering many different choices of the system parameters (e.g., length of the CLTU, decoding algorithm, maximum number of decoding iterations).

cs.IT↗