Neural Network-Based Successive Interference Cancellation for Non-Linear Bandlimited Channels
Daniel Plabst, Tobias Prinz, Francesca Diedolo, Thomas Wiegart, Georg Böcherer, Norbert Hanik, Gerhard Kramer
TL;DR
This work tackles achieving near-JDD information rates on bandlimited nonlinear channels with manageable receiver complexity. It introduces model-based NN equalizers that implement SIC using periodically time-varying Bidirectional RNNs, mirroring forward-backward state recursions to approximate APPs stage-by-stage. The results on short-reach fiber links with square-law detection show NN-SIC can nearly reach JDD performance, delivering substantial spectral efficiency and energy gains (up to about 3 dB) while reducing complexity relative to mismatched FBA and Gibbs sampling. The approach holds promise for practical direct-detection optical links and highlights avenues for coded modulation integration, robustness testing, and potential hardware implementations.
Abstract
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 3dB 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.
