Diego Lentner
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Diego Lentner has a total of 13 co-authors. Here are the top co-authors by number of shared publications:
- Thomas Wiegart
Technical University of Munich Munich Germany
4 shared publications - Constantin Runge
Institute for Communications Engineering Technical University of Munich 80333 Munich Germany
2 shared publications - Gerhard Kramer
Technical University of Munich
2 shared publications - Richard D. Wesel
Department of Electrical and Computer Engineering, University of California at Los Angeles, Los Angeles, CA, USA
2 shared publications - Emna Ben Yacoub
Heisenberg Research Center, Huawei Technologies Duesseldorf GmbH, Munich, Germany
1 shared publication - Frank R. Kschischang
Department of Electrical and Computer Engineering, University of Toronto, Toronto, Canada
1 shared publication
Latest Publications
- Open Access
Efficient Probabilistic Parity Shaping for Irregular Repeat-Accumulate LDPC Codes
Algorithms are presented that efficiently shape the parity bits of systematic irregular repeat-accumulate (IRA) low-density parity-check (LDPC) codes by following the sequential encoding order of the accumulator. Simulations over additive white Gaussian noise (AWGN) channels with on-off keying show a gain of up to 0.9 dB over uniform signaling.
Open AccessEfficient Probabilistic Parity Shaping for Irregular Repeat-Accumulate LDPC Codes
Algorithms are presented that efficiently shape the parity bits of systematic irregular repeat-accumulate (IRA) low-density parity-check (LDPC) codes by following the sequential encoding order of the accumulator. Simulations over additive white Gaussian noise (AWGN) channels with on-off keying show a gain of up to 0.9 dB over uniform signaling.
- Open Access
Improved List Decoding for Polar-Coded Probabilistic Shaping
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 provides error detection and decreases error rates compared to standard SCL decoding while at the same time reducing the length of the outer cyclic redundancy check code.
Open AccessImproved List Decoding for Polar-Coded Probabilistic Shaping
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 provides error detection and decreases error rates compared to standard SCL decoding while at the same time reducing the length of the outer cyclic redundancy check code.
- Open Access
Probabilistic Shaping for Asymmetric Channels and Low-Density Parity-Check Codes
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) channels with on-off keying modulation using 5G LDPC codes.
Open AccessProbabilistic Shaping for Asymmetric Channels and Low-Density Parity-Check Codes
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) channels with on-off keying modulation using 5G LDPC codes.
- 21 April 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Journal of Lightwave Technology
- Vol. 41 (17) , 5641-5652
Concatenated Forward Error Correction With KP4 and Single Parity Check Codes
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-end frame and bit error rates for transmission over additive white Gaussian noise channels with binary phase-shift keying (BPSK) and quaternary amplitude shift keying (4-ASK), as well as with symbol interleavers and quantized channel outputs. The BPSK error rates are compared to those of two other inner codes: a two-dimensional product code with SPC component codes and an extended Hamming code. Simulation results for unit-memory inter-symbol interference channels and 4-ASK are also presented. The results show that the coding schemes achieve similar error rates, but SPC codes have the lowest complexity and permit flexible rate adaptation.
- 21 April 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Journal of Lightwave Technology
- Vol. 41 (17) , 5641-5652
Concatenated Forward Error Correction With KP4 and Single Parity Check Codes
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-end frame and bit error rates for transmission over additive white Gaussian noise channels with binary phase-shift keying (BPSK) and quaternary amplitude shift keying (4-ASK), as well as with symbol interleavers and quantized channel outputs. The BPSK error rates are compared to those of two other inner codes: a two-dimensional product code with SPC component codes and an extended Hamming code. Simulation results for unit-memory inter-symbol interference channels and 4-ASK are also presented. The results show that the coding schemes achieve similar error rates, but SPC codes have the lowest complexity and permit flexible rate adaptation.
- Open Access
Multilevel Binary Polar-Coded Modulation Achieving the Capacity of Asymmetric Channels
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.
Open AccessMultilevel Binary Polar-Coded Modulation Achieving the Capacity of Asymmetric Channels
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.
- Open Access
Stealth Communication with Vanishing Power over Binary Symmetric Channels
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 unifies and generalizes existing rate bounds for covert and stealth communication.
Open AccessStealth Communication with Vanishing Power over Binary Symmetric Channels
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 unifies and generalizes existing rate bounds for covert and stealth communication.
- 30 March 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Journal of Lightwave Technology
- Vol. PP (07338724) , 1
Performance-Complexity Tradeoffs of Concatenated FEC for Higher-Order Modulation
Multilevel coding (MLC) is compared with bit-interleaved coded modulation (BICM) from a performance-versus-complexity standpoint. In both approaches, complexity-optimized error-reducing low-density parity-check inner codes are designed for concatenation with an outer hard-decision code, for various modulation orders. The codes are designed to achieve various points on the Pareto frontier characterizing the performance-complexity tradeoff. Computer simulations of the resulting codes reveal that MLC not only provides significant advantages compared with BICM, but also outperforms several existing MLC and BICM proposals. At 25% overhead, MLC provides a net coding gain of up to 12.8 dB with 16-QAM (1.0 dB from the constrained Shannon limit), a net coding gain of up to 13.6 dB with 64-QAM (1.2 dB from the constrained Shannon limit), and a net coding gain of up to 14 dB with 256-QAM (1.65 dB from the constrained Shannon limit), all with reasonable decoding complexity.
- 30 March 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Journal of Lightwave Technology
- Vol. PP (07338724) , 1
Performance-Complexity Tradeoffs of Concatenated FEC for Higher-Order Modulation
Multilevel coding (MLC) is compared with bit-interleaved coded modulation (BICM) from a performance-versus-complexity standpoint. In both approaches, complexity-optimized error-reducing low-density parity-check inner codes are designed for concatenation with an outer hard-decision code, for various modulation orders. The codes are designed to achieve various points on the Pareto frontier characterizing the performance-complexity tradeoff. Computer simulations of the resulting codes reveal that MLC not only provides significant advantages compared with BICM, but also outperforms several existing MLC and BICM proposals. At 25% overhead, MLC provides a net coding gain of up to 12.8 dB with 16-QAM (1.0 dB from the constrained Shannon limit), a net coding gain of up to 13.6 dB with 64-QAM (1.2 dB from the constrained Shannon limit), and a net coding gain of up to 14 dB with 256-QAM (1.65 dB from the constrained Shannon limit), all with reasonable decoding complexity.