Zobrazeno 1 - 9
of 9
pro vyhledávání: '"Lentner, Diego"'
Chase-Pyndiah decoding is widely used for decoding product codes. However, this method is suboptimal and requires scaling the soft information exchanged during the iterative processing. In this paper, we propose a framework for obtaining the scaling
Externí odkaz:
http://arxiv.org/abs/2308.08326
An algorithm is proposed to encode low-density parity-check (LDPC) codes into codewords with a non-uniform distribution. This enables power-efficient signalling for asymmetric channels. We show gains of 0.9 dB for additive white Gaussian noise (AWGN)
Externí odkaz:
http://arxiv.org/abs/2305.13376
A modified successive cancellation list (SCL) decoder is proposed for polar-coded probabilistic shaping. The decoder exploits the deterministic encoding rule for shaping bits to rule out candidate code words that the encoder would not generate. This
Externí odkaz:
http://arxiv.org/abs/2305.07962
Autor:
Lentner, Diego, Yacoub, Emna Ben, Calabrò, Stefano, Böcherer, Georg, Stojanović, Nebojša, Kramer, Gerhard
Concatenated forward error correction is studied using an outer KP4 Reed-Solomon code with hard-decision decoding and inner single parity check (SPC) codes with Chase/Wagner soft-decision decoding. Analytical expressions are derived for the end-to-en
Externí odkaz:
http://arxiv.org/abs/2212.10523
A multilevel coded modulation scheme is studied that uses solely binary polar codes and Honda-Yamamoto probabilistic shaping. The scheme is shown to achieve the capacity of discrete memoryless channels with input alphabets of cardinality a power of t
Externí odkaz:
http://arxiv.org/abs/2202.04010
Autor:
Lentner, Diego, Kramer, Gerhard
A framework for stealth communication with vanishing power (VP) is presented by studying binary symmetric channels. Coding theorems are proved by modifying Gallager's error exponents for VP and by applying resolvability exponents. The analysis unifie
Externí odkaz:
http://arxiv.org/abs/2005.06313
Linear layered probabilistic shaping (LLPS) is proposed, an architecture for linear codes to efficiently encode to shaped code words. In the previously proposed probabilistic amplitude shaping (PAS) architecture, a distribution matcher (DM) maps info
Externí odkaz:
http://arxiv.org/abs/1902.10648
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.