activity
20162025
most citedPolar Code Construction for List Decoding

30 citations · 62 across the 13 of their papers we have counts for

collaborators

14 papers

cs.IT2025

Information Rates of Approximate Message Passing for Bandlimited Direct-Detection Channels

Daniel Plabst, Mohamed Akrout, Tobias Prinz +2

The capacity of bandlimited direct-detection channels is challenging to compute or approach due to the receiver non-linearity. A generalized vector approximate message passing (GVA…

cs.IT2024

Neural Network Equalizers and Successive Interference Cancellation for Bandlimited Channels with a Nonlinearity

Daniel Plabst, Tobias Prinz, Francesca Diedolo +4

Neural networks (NNs) inspired by the forward-backward algorithm (FBA) are used as equalizers for bandlimited channels with a memoryless nonlinearity. The NN-equalizers are combine…

cs.IT2024

Neural Network-Based Successive Interference Cancellation for Non-Linear Bandlimited Channels

Daniel Plabst, Tobias Prinz, Francesca Diedolo +4

Reliable communication over bandlimited and non-linear channels usually requires equalization to simplify receiver processing. Equalizers that perform joint detection and decoding…

cs.IT2022

Successive Interference Cancellation for Bandlimited Channels with Direct Detection

Tobias Prinz, Daniel Plabst, Thomas Wiegart +3

The maximum information rates for bandlimited channels with direct detection are achieved with joint detection and decoding (JDD), but JDD is often too complex to implement. Two re…

cs.IT2022★ 1 cited

Comparison of PAM-6 Modulations for Short-Reach Fiber-Optic Links with Intensity Modulation and Direct Detection

Tobias Prinz, Thomas Wiegart, Daniel Plabst +6

PAM-6 transmission is considered for short-reach fiber-optic links with intensity modulation and direct detection. Experiments show that probabilistically-shaped PAM-6 and a framed…

cs.IT2022★ 1 cited

Experiments on Bipolar Transmission with Direct Detection

Thomas Wiegart, Daniel Plabst, Tobias Prinz +6

Achievable information rates of bipolar 4- and 8-ary constellations are experimentally compared to those of intensity modulation (IM) when using an oversampled direct detection rec…

cs.IT2022★ 17 cited

Multilevel Binary Polar-Coded Modulation Achieving the Capacity of Asymmetric Channels

Constantin Runge, Thomas Wiegart, Diego Lentner +1

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 discret…

cs.IT2021★ 11 cited

Achievable Rates for Short-Reach Fiber-Optic Channels with Direct Detection

Daniel Plabst, Tobias Prinz, Thomas Wiegart +5

Spectrally efficient communication is studied for short-reach fiber-optic links with chromatic dispersion (CD) and receivers that employ direction-detection and oversampling. Achie…

cs.IT2021

PAM-6 Coded Modulation for IM/DD Channels with a Peak-Power Constraint

Tobias Prinz, Thomas Wiegart, Daniel Plabst +4

Coded modulation with probabilistic amplitude shaping (PAS) is considered for intensity modulation/direct detection channels with a transmitter peak-power constraint. PAS is used t…

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★ 1 cited

Successive Cancellation List Decoding of BMERA Codes with Application to Higher-Order Modulation

Tobias Prinz, Peihong Yuan

BMERA or convolutional polar codes are an extension of polar codes with a provably better error exponent than polar codes. A successive cancellation (SC) decoding algorithm for BME…

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.IT2017★ 30 cited

Polar Code Construction for List Decoding

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

A heuristic construction of polar codes for successive cancellation list (SCL) decoding with a given list size is proposed to balance the trade-off between performance measured in…

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…