跳到正文
研踪PaperTrail

论文库

检索计算机领域论文,按研究方向、作者或关键词筛选。

部分采集异常
正在读取账号与研究记录…

全站更新概况

+0新增论文
+0其中 AI 相关
+0已有论文修订
+92新增 AI 导读

arXiv 最近完成扫描:2026-11-23 01:07 · 全站最近入库:2026-11-21 12:19各信源进度 →

统计口径与数据新鲜度

统计 2026-11-22 03:55 — 2026-11-23 03:55(北京时间) · 点击数字查看对应简报;AI 相关包含在新增论文内。

最近完成检查:2026-11-23 01:07最近发现新增版本:2026-11-21 12:19库内论文最新更新时间:2026-11-20 02:59

每分钟刷新已保存的数据。空检查不代表采集异常;新收录可能包含历史论文。AI 导读按新增版本计数。

29,158 已收录论文24,181 AI 相关8,992 有修订112 HF 社区发现

浏览论文库

时间范围跟随排序:版本更新、本站收录或首次发表。最新收录可能包含历史论文。部分信源异常,查看状态 →

找到 1 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-23 01:05(北京时间)
新论文 · v1arXiv:2611.20914

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

Massimo Battaglioni, Mauro M. M. Costantino, Rebecca Giuliani, Franco Chiaraluce, Marco Baldi

原文摘要

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