activity
20142022
most citedProbabilistically Shaped 4-PAM for Short-Reach IM/DD Links with a Peak Power Constraint

35 citations · 212 across the 30 of their papers we have counts for

collaborators
Showing 2018Show all

10 papers · 1 filter

cs.IT2018★ 2 cited

Efficient Error-Correcting Codes in the Short Blocklength Regime

Mustafa Cemil Coşkun, Giuseppe Durisi, Thomas Jerkovits +4

The design of block codes for short information blocks (e.g., a thousand or less information bits) is an open research problem that is gaining relevance thanks to emerging applicat…

cs.IT2018★ 16 cited

Protograph-Based LDPC Code Design for Ternary Message Passing Decoding

Emna Ben Yacoub, Fabian Steiner, Balazs Matuz +1

A ternary message passing (TMP) decoding algorithm for low-density parity-check codes is developed. All messages exchanged between variable and check nodes have a ternary alphabet,…

cs.IT2018

Optimization of Bit Mapping and Quantized Decoding for Off-the-Shelf Protograph LDPC Codes with Application to IEEE 802.3ca

Fabian Steiner, Gerhard Kramer

Protograph-based, off-the-shelf low-density parity-check (LDPC) codes are optimized for higher-order modulation and quantized sum-product decoders. As an example, for the recently…

cs.IT2018★ 29 cited

Bit-Metric Decoding of Non-Binary LDPC Codes with Probabilistic Amplitude Shaping

Fabian Steiner, Georg Böcherer, Gianluigi Liva

A new approach for combining non-binary low-density parity-check (NB-LDPC) codes with higher-order modulation and probabilistic amplitude shaping (PAS) is presented. Instead of sym…

cs.IT2018★ 1 cited

Construction and Decoding Algorithms for for Polar Codes based on Non-Binary Kernels

Peihong Yuan, Fabian Steiner

Polar codes based on non-binary kernels are discussed in this work. The kernel over is selected by maximizing the polarization effect and using Monte-Carl…

cs.IT2018★ 1 cited

Blind Decoding-Metric Estimation for Probabilistic Shaping via Expectation Maximization

Fabian Steiner, Patrick Schulte, Georg Böcherer

An unsupervised learning approach based on expectation maximization is proposed to obtain the parameters of a soft decision forward error correction decoding metric for probabilist…

cs.IT2018★ 1 cited

Flexible IR-HARQ Scheme for Polar-Coded Modulation

Peihong Yuan, Fabian Steiner, Tobias Prinz +1

A flexible incremental redundancy hybrid auto- mated repeat request (IR-HARQ) scheme for polar codes is proposed based on dynamically frozen bits and the quasi-uniform puncturing (…

cs.IT2018

Approaching Waterfilling Capacity of Parallel Channels by Higher Order Modulation and Probabilistic Amplitude Shaping

Fabian Steiner, Georg Böcherer, Patrick Schulte

Parallel, additive white Gaussian noise (AWGN) channels with an average sum power constraint are considered. It is shown how the waterfilling Shannon capacity can be approached by…

cs.IT2018★ 11 cited

Experimental Verification of Rate Flexibility and Probabilistic Shaping by 4D Signaling

Fabian Steiner, Francesco Da Ros, Metodi Plamenov Yankov +4

The rate flexibility and probabilistic shaping gain of -dimensional signaling is experimentally tested for short-reach, unrepeated transmission. A rate granularity of 0.5 bits/Q…

cs.IT2018★ 1 cited

Divergence-Optimal Fixed-to-Fixed Length Distribution Matching With Shell Mapping

Patrick Schulte, Fabian Steiner

Distribution matching (DM) transforms independent and Bernoulli(1/2) distributed bits into a sequence of output symbols with a desired distribution. A fixed-to-fixed length, invert…