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

32 papers

cs.IT2022★ 9 cited

Low-Resolution Precoding for Multi-Antenna Downlink Channels and OFDM

Andrei Stefan Nedelcu, Fabian Steiner, Gerhard Kramer

Downlink precoding is considered for multi-path multi-input single-output channels where the base station uses orthogonal frequency-division multiplexing and low-resolution signali…

cs.IT2020★ 35 cited

Probabilistically Shaped 4-PAM for Short-Reach IM/DD Links with a Peak Power Constraint

Thomas Wiegart, Francesco Da Ros, Metodi Plamenov Yankov +3

Probabilistic shaping for intensity modulation and direct detection (IM/DD) links is discussed and a peak power constraint determined by the limited modulation extinction ratio (ER…

cs.IT2019

Coding for Optical Communications -- Can We Approach the Shannon Limit With Low Complexity?

Alexandre Graell i Amat, Gianluigi Liva, Fabian Steiner

Approaching capacity with low complexity is a very challenging task. In this paper, we review and compare three promising coding solutions to achieve that, which are suitable for f…

cs.IT2019

Shaped On-Off Keying Using Polar Codes

Thomas Wiegart, Fabian Steiner, Patrick Schulte +1

The probabilistic shaping scheme from Honda and Yamamoto (2013) for polar codes is used to enable power-efficient signaling for on-off keying (OOK). As OOK has a non-symmetric opti…

cs.IT2019★ 4 cited

Probabilistic Parity Shaping for Linear Codes

Georg Böcherer, Diego Lentner, Alessandro Cirino +1

Linear layered probabilistic shaping (LLPS) is proposed, an architecture for linear codes to efficiently encode to shaped code words. In the previously proposed probabilistic ampli…

cs.IT2019★ 21 cited

One and Two Bit Message Passing for SC-LDPC Codes with Higher-Order Modulation

Fabian Steiner, Emna Ben Yacoub, Balazs Matuz +2

Low complexity decoding algorithms are necessary to meet data rate requirements in excess of 1 Tbps. In this paper, we study one and two bit message passing algorithms for belief p…

cs.IT2019★ 1 cited

Protograph-Based LDPC Code Design for Probabilistic Shaping with On-Off Keying

Alexandru Dominic Git, Balázs Matuz, Fabian Steiner

This work investigates protograph-based LDPC codes for the AWGN channel with OOK modulation. A non-uniform distribution of the OOK modulation symbols is considered to improve the p…

cs.IT2019

Design of Polar Codes for Parallel Channels with an Average Power Constraint

Thomas Wiegart, Tobias Prinz, Fabian Steiner +1

Polar codes are designed for parallel binary-input additive white Gaussian noise (BiAWGN) channels with an average power constraint. The two main design choices are: the mapping be…

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…

cs.IT2017★ 4 cited

Quantized Precoding for Multi-Antenna Downlink Channels with MAGIQ

Andrei Nedelcu, Fabian Steiner, Markus Staudacher +5

A multi-antenna, greedy, iterative, and quantized (MAGIQ) precoding algorithm is proposed for downlink channels. MAGIQ allows a straightforward integration with orthogonal frequenc…

cs.IT2017

Ultra-Sparse Non-Binary LDPC Codes for Probabilistic Amplitude Shaping

Fabian Steiner, Gianluigi Liva, Georg Böcherer

This work shows how non-binary low-density parity-check codes over GF() can be combined with probabilistic amplitude shaping (PAS) (Böcherer, et al., 2015), which combines for…

cs.IT2017★ 5 cited

Spatial Coding Based on Minimum BER in 1-Bit Massive MIMO Systems

Hela Jedda, Amine Mezghani, Jawad Munir +2

We consider a downlink 1-bit quantized multiuser (MU) multiple-input-multiple-output (MIMO) system, where 1-bit digital-to-analog (DACs) and analog-to-digital converters (ADCs) are…

cs.IT2017★ 33 cited

Probabilistic Amplitude Shaping with Hard Decision Decoding and Staircase Codes

Alireza Sheikh, Alexandre Graell i Amat, Gianluigi Liva

We consider probabilistic amplitude shaping (PAS) as a means of increasing the spectral efficiency of fiber-optic communication systems. In contrast to previous works in the litera…

cs.IT2017★ 27 cited

High Throughput Probabilistic Shaping with Product Distribution Matching

Georg Böcherer, Patrick Schulte, Fabian Steiner

Product distribution matching (PDM) is proposed to generate target distributions over large alphabets by combining the output of several parallel distribution matchers (DMs) with s…

cs.IT2016

Efficient Polar Code Construction for Higher-Order Modulation

Georg Böcherer, Tobias Prinz, Peihong Yuan +1

An efficient algorithm for the construction of polar codes for higher-order modulation is presented based on information-theoretic principles. The bit reliabilities after successiv…