Searcharxiv⌕ Search

arXiv subjects

Laurent Schmalen

Publications and source records attributed to Laurent Schmalen.

At least 127 records · Page 7Linked to original sources

Decoder-in-the-Loop: Genetic Optimization-based LDPC Code Design

LDPC code design tools typically rely on asymptotic code behavior and are affected by an unavoidable performance degradation due to model imperfections in the short length regime. We propose an LDPC code design scheme based on an evolutionary algorithm, the Genetic Algorithm (GenAlg), implementing a "decoder-in-the-loop" concept. It inherently takes into consideration the channel, code length and the number of iterations while optimizing the error-rate of the actual decoder hardware architecture. We construct short length LDPC codes (i.e., the parity-check matrix) with error-rate performance comparable to, or even outperforming that of well-designed standardized short length LDPC codes over both AWGN and Rayleigh fading channels. Our proposed algorithm can be used to design LDPC codes with special graph structures (e.g., accumulator-based codes) to facilitate the encoding step, or to satisfy any other practical requirement. Moreover, GenAlg can be used to design LDPC codes with the aim of reducing decoding latency and complexity, leading to coding gains of up to $0.325$ dB and $0.8$ dB at BLER of $10^{-5}$ for both AWGN and Rayleigh fading channels, respectively, when compared to state-of-the-art short LDPC codes. Also, we analyze what can be learned from the resulting codes and, as such, the GenAlg particularly highlights design paradigms of short length LDPC codes (e.g., codes with degree-1 variable nodes obtain very good results).

cs.IT↗

Spatially Coupled LDPC Codes with Non-uniform Coupling for Improved Decoding Speed

We consider spatially coupled low-density parity-check codes with finite smoothing parameters. A finite smoothing parameter is important for designing practical codes that are decoded using low-complexity windowed decoders. By optimizing the amount of coupling between spatial positions, we show that we can construct codes with improved decoding speed compared with conventional, uniform smoothing constructions. This leads to a significantly better performance under decoder complexity constraints while keeping the degree distribution regular. We optimize smoothing configurations using differential evolution and illustrate the performance gains by means of a simulation.

cs.IT↗

End-to-End Optimized Transmission over Dispersive Intensity-Modulated Channels Using Bidirectional Recurrent Neural Networks

We propose an autoencoding sequence-based transceiver for communication over dispersive channels with intensity modulation and direct detection (IM/DD), designed as a bidirectional deep recurrent neural network (BRNN). The receiver uses a sliding window technique to allow for efficient data stream estimation. We find that this sliding window BRNN (SBRNN), based on end-to-end deep learning of the communication system, achieves a significant bit-error-rate reduction at all examined distances in comparison to previous block-based autoencoders implemented as feed-forward neural networks (FFNNs), leading to an increase of the transmission distance. We also compare the end-to-end SBRNN with a state-of-the-art IM/DD solution based on two level pulse amplitude modulation with an FFNN receiver, simultaneously processing multiple received symbols and approximating nonlinear Volterra equalization. Our results show that the SBRNN outperforms such systems at both 42 and 84\,Gb/s, while training fewer parameters. Our novel SBRNN design aims at tailoring the end-to-end deep learning-based systems for communication over nonlinear channels with memory, such as the optical IM/DD fiber channel.

cs.IT↗

A Compressed Sensing Approach for Distribution Matching

In this work, we formulate the fixed-length distribution matching as a Bayesian inference problem. Our proposed solution is inspired from the compressed sensing paradigm and the sparse superposition (SS) codes. First, we introduce sparsity in the binary source via position modulation (PM). We then present a simple and exact matcher based on Gaussian signal quantization. At the receiver, the dematcher exploits the sparsity in the source and performs low-complexity dematching based on generalized approximate message-passing (GAMP). We show that GAMP dematcher and spatial coupling lead to asymptotically optimal performance, in the sense that the rate tends to the entropy of the target distribution with vanishing reconstruction error in a proper limit. Furthermore, we assess the performance of the dematcher on practical Hadamard-based operators. A remarkable feature of our proposed solution is the possibility to: i) perform matching at the symbol level (nonbinary); ii) perform joint channel coding and matching.

cs.IT↗

Avoiding Burst-like Error Patterns in Windowed Decoding of Spatially Coupled LDPC Codes

In this work, we analyze efficient window shift schemes for windowed decoding of spatially coupled low-density parity-check (SC-LDPC) codes, which is known to yield close-tooptimal decoding results when compared to full belief propagation (BP) decoding. However, a drawback of windowed decoding is that either a significant amount of window updates are required leading to unnecessary high decoding complexity or the decoder suffers from sporadic burst-like error patterns, causing a decoder stall. To tackle this effect and, thus, to reduce the average decoding complexity, the basic idea is to enable adaptive window shifts based on a bit error rate (BER) prediction, which reduces the amount of unnecessary updates. As the decoder stall does not occur in analytical investigations such as the density evolution (DE), we examine different schemes on a fixed test-set and exhaustive monte-carlo simulations based on our graphic processing unit (GPU) simulation framework. As a result, we can reduce the average decoding complexity of the naive windowed decoder while improving the BER performance when compared to a non-adaptive windowed decoding scheme. Furthermore, we show that a foresightful stall prediction does not significantly outperform a retrospective stall detection which is much easier to implement in practice.

cs.IT↗

Probabilistic Eigenvalue Shaping for Nonlinear Fourier Transform Transmission

We consider a nonlinear Fourier transform (NFT)-based transmission scheme, where data is embedded into the imaginary part of the nonlinear discrete spectrum. Inspired by probabilistic amplitude shaping, we propose a probabilistic eigenvalue shaping (PES) scheme as a means to increase the data rate of the system. We exploit the fact that for an NFT-based transmission scheme the pulses in the time domain are of unequal duration by transmitting them with a dynamic symbol interval and find a capacity-achieving distribution. The PES scheme shapes the information symbols according to the capacity-achieving distribution and transmits them together with the parity symbols at the output of a low-density parity-check encoder, suitably modulated, via time-sharing. We furthermore derive an achievable rate for the proposed PES scheme. We verify our results with simulations of the discrete-time model as well as with split-step Fourier simulations.

cs.IT↗

End-to-end Deep Learning of Optical Fiber Communications

In this paper, we implement an optical fiber communication system as an end-to-end deep neural network, including the complete chain of transmitter, channel model, and receiver. This approach enables the optimization of the transceiver in a single end-to-end process. We illustrate the benefits of this method by applying it to intensity modulation/direct detection (IM/DD) systems and show that we can achieve bit error rates below the 6.7\% hard-decision forward error correction (HD-FEC) threshold. We model all componentry of the transmitter and receiver, as well as the fiber channel, and apply deep learning to find transmitter and receiver configurations minimizing the symbol error rate. We propose and verify in simulations a training method that yields robust and flexible transceivers that allow---without reconfiguration---reliable transmission over a large range of link dispersions. The results from end-to-end deep learning are successfully verified for the first time in an experiment. In particular, we achieve information rates of 42\,Gb/s below the HD-FEC threshold at distances beyond 40\,km. We find that our results outperform conventional IM/DD solutions based on 2 and 4 level pulse amplitude modulation (PAM2/PAM4) with feedforward equalization (FFE) at the receiver. Our study is the first step towards end-to-end deep learning-based optimization of optical fiber communication systems.

cs.IT↗

Finite-Length Analysis of Spatially-Coupled Regular LDPC Ensembles on Burst-Erasure Channels

Regular spatially-Coupled LDPC (SC-LDPC) ensembles have gained significant interest since they were shown to universally achieve the capacity of binary memoryless channels under low-complexity belief-propagation decoding. In this work, we focus primarily on the performance of these ensembles over binary channels affected by bursts of erasures. We first develop an analysis of the finite length performance for a single burst per codeword and no errors otherwise. We first assume that the burst erases a complete spatial position, modeling for instance node failures in distributed storage. We provide new tight lower bounds for the block erasure probability ($P_{\mathrm{B}}$) at finite block length and bounds on the coupling parameter for being asymptotically able to recover the burst. We further show that expurgating the ensemble can improve the block erasure probability by several orders of magnitude. Later we extend our methodology to more general channel models. In a first extension, we consider bursts that can start at a random position in the codeword and span across multiple spatial positions. Besides the finite length analysis, we determine by means of density evolution the maximnum correctable burst length. In a second extension, we consider the case where in addition to a single burst, random bit erasures may occur. Finally, we consider a block erasure channel model which erases each spatial position independently with some probability $p$, potentially introducing multiple bursts simultaneously. All results are verified using Monte-Carlo simulations.

cs.IT↗

Wave-like Decoding of Tail-biting Spatially Coupled LDPC Codes Through Iterative Demapping

For finite coupling lengths, terminated spatially coupled low-density parity-check (SC-LDPC) codes show a non-negligible rate-loss. In this paper, we investigate if this rate loss can be mitigated by tail-biting SC-LDPC codes in conjunction with iterative demapping of higher order modulation formats. Therefore, we examine the BP threshold of different coupled and uncoupled ensembles. A comparison between the decoding thresholds approximated by EXIT charts and the density evolution results of the coupled and uncoupled ensemble is given. We investigate the effect and potential of different labelings for such a set-up using per-bit EXIT curves, and exemplify the method for a 16-QAM system, e.g., using set partitioning labelings. A hybrid mapping is proposed, where different sub-blocks use different labelings in order to further optimize the decoding thresholds of tail-biting codes, while the computational complexity overhead through iterative demapping remains small.

cs.IT↗

Advances in Detection and Error Correction for Coherent Optical Communications: Regular, Irregular, and Spatially Coupled LDPC Code Designs

In this chapter, we show how the use of differential coding and the presence of phase slips in the transmission channel affect the total achievable information rates and capacity of a system. By means of the commonly used QPSK modulation, we show that the use of differential coding does not decrease the total amount of reliably conveyable information over the channel. It is a common misconception that the use of differential coding introduces an unavoidable differential loss. This perceived differential loss is rather a consequence of simplified differential detection and decoding at the receiver. Afterwards, we show how capacity-approaching coding schemes based on LDPC and spatially coupled LDPC codes can be constructed by combining iterative demodulation and decoding. For this, we first show how to modify the differential decoder to account for phase slips and then how to use this modified differential decoder to construct good LDPC codes. This construction method can serve as a blueprint to construct good and practical LDPC codes for other applications with iterative detection, such as higher order modulation formats with non-square constellations, multi-dimensional optimized modulation formats, turbo equalization to mitigate ISI (e.g., due to nonlinearities) and many more. Finally, we introduce the class of spatially coupled (SC)-LDPC codes, which are a generalization of LDPC codes with some outstanding properties and which can be decoded with a very simple windowed decoder. We show that the universal behavior of spatially coupled codes makes them an ideal candidate for iterative differential demodulation/detection and decoding.

cs.IT↗

Non-Uniformly Coupled LDPC Codes: Better Thresholds, Smaller Rate-loss, and Less Complexity

We consider spatially coupled low-density parity-check codes with finite smoothing parameters. A finite smoothing parameter is important for designing practical codes that are decoded using low-complexity windowed decoders. By optimizing the amount of coupling between spatial positions, we show that we can construct codes with excellent thresholds and small rate loss, even with the lowest possible smoothing parameter and large variable node degrees, which are required for low error floors. We also establish that the decoding convergence speed is faster with non-uniformly coupled codes, which we verify by density evolution of windowed decoding with a finite number of iterations. We also show that by only slightly increasing the smoothing parameter, practical codes with potentially low error floors and thresholds close to capacity can be constructed. Finally, we give some indications on protograph designs.

cs.IT↗

Feed-Forward Staircase Codes

We propose two variants of staircase codes that resolve the issue of parity-propagation in their encoding process. The proposed codes provide a systematic way of terminating a staircase code after an arbitrary number of blocks. The class of feed-forward staircase codes are introduced, which uses a self-protection technique to avoid parity-propagation. We also introduce the class of partial feed-forward staircase codes, which allows parity-propagation to occur over a given number of blocks. By amortizing the complexity of self-protection over several standard staircase blocks, the encoding complexity of these codes is made comparable to staircase codes. Partial feed-forward staircase codes have the same error-floor as staircase codes. Simulations confirm that the performance of the proposed codes in both the waterfall and error-floor regions is similar to the original staircase codes. The proposed codes help extend the domain of application of staircase codes to systems in which parity-propagation is undesirable or termination is necessary.

cs.IT↗

Performance Prediction of Nonbinary Forward Error Correction in Optical Transmission Experiments

In this paper, we compare different metrics to predict the error rate of optical systems based on nonbinary forward error correction (FEC). It is shown that the correct metric to predict the performance of coded modulation based on nonbinary FEC is the mutual information. The accuracy of the prediction is verified in a detailed example with multiple constellation formats, FEC overheads in both simulations and optical transmission experiments over a recirculating loop. It is shown that the employed FEC codes must be universal if performance prediction based on thresholds is used. A tutorial introduction into the computation of the threshold from optical transmission measurements is also given.

cs.IT↗

Spatially Coupled LDPC Codes Affected by a Single Random Burst of Erasures

Spatially-Coupled LDPC (SC-LDPC) ensembles achieve the capacity of binary memoryless channels (BMS), asymptotically, under belief-propagation (BP) decoding. In this paper, we study the BP decoding of these code ensembles over a BMS channel and in the presence of a single random burst of erasures. We show that in the limit of code length, codewords can be recovered successfully if the length of the burst is smaller than some maximum recoverable burst length. We observe that the maximum recoverable burst length is practically the same if the transmission takes place over binary erasure channel or over binary additive white Gaussian channel with the same capacity. Analyzing the stopping sets, we also estimate the decoding failure probability (the error floor) when the code length is finite.

cs.IT↗

Triggering Wave-Like Convergence of Tail-biting Spatially Coupled LDPC Codes

Spatially coupled low-density parity-check (SC-LDPC) codes can achieve the channel capacity under low-complexity belief propagation (BP) decoding, however, there is a non-negligible rate-loss because of termination effects for practical finite coupling lengths. In this paper, we study how we can approach the performance of terminated SC-LDPC codes by random shortening of tail-biting SC-LDPC codes. We find the minimum required rate-loss in order to achieve the same performance than terminated codes. We additionally study the use of tail-biting SC-LDPC codes for transmission over parallel channels (e.g., bit-interleaved-coded-modulation (BICM)) and investigate how the distribution of the coded bits between two parallel channels can change the performance of the code. We show that a tail-biting SC-LDPC code can be used with BP decoding almost anywhere within the achievable region of MAP decoding. The optimization comes with a mandatory buffer at the encoder side. We evaluate different distributions of coded bits in order to reduce this buffer length.

cs.IT↗

Spatially Coupled Codes and Optical Fiber Communications: An Ideal Match?

In this paper, we highlight the class of spatially coupled codes and discuss their applicability to long-haul and submarine optical communication systems. We first demonstrate how to optimize irregular spatially coupled LDPC codes for their use in optical communications with limited decoding hardware complexity and then present simulation results with an FPGA-based decoder where we show that very low error rates can be achieved and that conventional block-based LDPC codes can be outperformed. In the second part of the paper, we focus on the combination of spatially coupled LDPC codes with different demodulators and detectors, important for future systems with adaptive modulation and for varying channel characteristics. We demonstrate that SC codes can be employed as universal, channel-agnostic coding schemes.

cs.IT↗

High Speed Data Transmission over GI-MMF Using Mode Group Division Multiplexing

We transmitted 4x28 Gbit/s over 5-km standard GI-MMF using four different mode groups in combination with direct detection and on-off-keying format (OOK). Due to the square-law detection in the receiver MIMO processing is not effective. Therefore proper mode group selective multiplexing and de-multiplexing is essential.

cs.NI↗