TPTobias Prinz

Tobias Prinz

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Tobias Prinz has a total of 20 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

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

    by Daniel Plabst, Mohamed Akrout, Tobias Prinz, Amine Mezghani, Gerhard Kramer

    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 (GVAMP) detector is designed to achieve high rates at a reasonable level of complexity. The rates increase by using multi-level coding and successive interference cancellation. The methods are applied to fiber-optic channels with intersymbol interference caused by spectrally efficient pulse shapes, chromatic dispersion, and receiver sampling at twice the baud rate. Bipolar modulation operates within 0.26 bits per channel use (bpcu) of the real-alphabet coherent capacity for optically amplified links, reducing the best-known theoretical gap of 1 bpcu. Remarkably, bipolar modulation achieves 6 dB and 3 dB of power gain over unipolar modulation with and without optical amplification, respectively. Simulations with polar-coded modulation confirm the gains. The GVAMP complexity, measured in multiplications per information bit (mpib), is proportional to the number of iterations and to the logarithm of the block length, and is substantially lower than that of other equalizers. For example, a system with 64-ary bipolar modulation and a root-raised cosine pulse with a 1% roll-off factor was simulated over 4 km of optically amplified standard single-mode fiber in the C-band. The GVAMP receiver requires 93 mpib to achieve 5 bpcu at 300 gigabaud.


  • Open Access

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

    by Daniel Plabst, Tobias Prinz, Francesca Diedolo, Thomas Wiegart, Georg Böcherer, Norbert Hanik, Gerhard Kramer

    Reliable communication over bandlimited and non-linear channels usually requires equalization to simplify receiver processing. Equalizers that perform joint detection and decoding (JDD) achieve the highest information rates but are often too complex to implement. To address this challenge, model-based neural network (NN) equalizers that perform successive interference cancellation (SIC) are shown to approach JDD information rates for bandlimited channels with a memoryless nonlinearity and additive white Gaussian noise. The NNs are chosen to have a periodically time-varying and recurrent structure that imitates the forward-backward algorithm (FBA) in every SIC stage. Simulations for short-haul fiber-optic links with square-law detection show that NN-SIC nearly doubles current spectral efficiencies, and bipolar or complex-valued modulations achieve energy gains of up to 3 dB compared to state-of-the-art intensity modulation. Moreover, NN-SIC is considerably less complex than equalizers that perform JDD, mismatched FBA processing, and Gibbs sampling.


  • Open Access

    Successive Interference Cancellation for Bandlimited Channels with Direct Detection

    by Tobias Prinz, Daniel Plabst, Thomas Wiegart, Stefano Calabrò, Norbert Hanik, Gerhard Kramer

    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 receiver structures are studied to reduce complexity: separate detection and decoding (SDD) and successive interference cancellation (SIC). For bipolar modulation, frequency-domain raised-cosine pulse shaping, and fiber-optic channels with chromatic dispersion, SIC achieves rates close to those of JDD, thereby attaining significant energy gains over SDD and intensity modulation. Gibbs sampling further reduces the detector complexity and achieves rates close to those of the forward-backward algorithm at low to intermediate signal-to-noise ratio (SNR) but stalls at high SNR. Simulations with polar codes, higher-order modulation, and multi-level coding confirm the predicted gains.

  • Successive Interference Cancellation for Bandlimited Channels With Direct Detection

    by Tobias Prinz, Daniel Plabst, Thomas Wiegart, Stefano Calabrò, Norbert Hanik, Gerhard Kramer

    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 receiver structures are studied to reduce complexity: separate detection and decoding (SDD) and successive interference cancellation (SIC). For bipolar modulation, frequency-domain raised-cosine pulse shaping, and fiber-optic channels with chromatic dispersion, SIC achieves rates close to those of JDD, thereby attaining significant energy gains over SDD and intensity modulation. Gibbs sampling further reduces the detector complexity and achieves rates close to those of the forward-backward algorithm at low to intermediate signal-to-noise ratio (SNR) but stalls at high SNR. Simulations with polar codes, higher-order modulation, and multi-level coding confirm the predicted gains.


  • Open Access

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

    by Constantin Runge, Thomas Wiegart, Diego Lentner, Tobias Prinz

    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 two. The performance of finite-length implementations is compared to polar-coded probabilistic amplitude shaping and constant composition distribution matching.

  • Achievable Rates for Short-Reach Fiber-Optic Channels With Direct Detection

    by Daniel Plabst, Tobias Prinz, Thomas Wiegart, Talha Rahman, Nebojsa Stojanovic, Stefano Calabro, Norbert Hanik, Gerhard Kramer

    Spectrally efficient communication is studied for short-reach fiber-optic links with chromatic dispersion (CD) and receivers that employ direction-detection and oversampling. Achievable rates and symbol error probabilities are computed by using auxiliary channels that account for memory in the sampled symbol strings. Real-alphabet bipolar and complex-alphabet symmetric modulations are shown to achieve significant energy gains over classic intensity modulation. Moreover, frequency-domain raised-cosine (FD-RC) pulses outperform time-domain RC (TD-RC) pulses in terms of spectral efficiency for two scenarios. First, if one shares the spectrum with other users then inter-channel interference significantly reduces the TD-RC rates. Second, if there is a transmit filter to avoid interference then the detection complexity of FD-RC and TD-RC pulses is similar but FD-RC achieves higher rates.


  • Open Access

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

    by Thomas Wiegart, Tobias Prinz, Fabian Steiner, Peihong Yuan

    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 between codeword bits and channels of different quality, and the power allocation under the average power constraint. Information theory suggests to allocate power such that the sum of mutual information (MI) terms is maximized. However, a power allocation specific to polar codes shows significant gains.

  • Open Access

    Polar Code Construction for List Decoding

    by Peihong Yuan, Tobias Prinz, Georg Böcherer, Onurcan İşcan, Ronald Böhnke, Wen Xu

    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 frame error rate (FER) and decoding complexity. Furthermore, a construction based on dynamically frozen bits with constraints among the "low weight bits" (LWB) is presented. Simulation results show that the LWB-polar codes outperform the CRC-polar codes and the eBCH-polar codes under SCL decoding.

  • Open Access

    Flexible IR-HARQ Scheme for Polar-Coded Modulation

    by Peihong Yuan, Fabian Steiner, Tobias Prinz, Georg Böcherer

    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 (QUP) algorithm. The length of each transmission is not restricted to a power of two. It is applicable for the binary input additive white Gaussian noise (biAWGN) channel as well as higher-order modulation. Simulation results show that this scheme has similar performance as directly designed polar codes with QUP and outperforms LTE-turbo and 5G-LDPC codes with IR-HARQ.

  • Open Access

    Efficient Polar Code Construction for Higher-Order Modulation

    by Georg Böcherer, Tobias Prinz, Peihong Yuan, Fabian Steiner

    An efficient algorithm for the construction of polar codes for higher-order modulation is presented based on information-theoretic principles. The bit reliabilities after successive demapping are estimated using the LM-rate, an achievable rate for mismatched decoding. The successive demapper bit channels are then replaced by binary input Additive White Gaussian Noise (biAWGN) surrogate channels and polar codes are constructed using the Gaussian approximation (GA). This LM-rate Demapper GA (LM-DGA) construction is used to construct polar codes for several demapping strategies proposed in literature. For all considered demappers, the LM-DGA constructed polar codes have the same performance as polar codes constructed by Monte Carlo (MC) simulation. The proposed LM-DGA construction is much faster than the MC construction. For 64-QAM, spectral efficiency 3 bits/s/Hz, and block length 1536 bits, simulation results show that LM-DGA constructed polar codes with cyclic redundancy check and successive cancellation list decoding are 1 dB more power efficient than state-of-the-art AR4JA low-density parity-check codes.