Reducing Computational Complexity of Neural Networks in Optical Channel Equalization: From Concepts to Implementation

Abstract

This paper introduces a novel methodology for developing low-complexity neural network (NN) based equalizers to address impairments in high-speed coherent optical transmission systems. We present a comprehensive exploration and comparison of deep model compression techniques applied to feed-forward and recurrent NN designs, assessing their impact on equalizer performance. Our investigation encompasses quantization, weight clustering, pruning, and other cutting-edge compression strategies. We propose and evaluate a Bayesian optimization-assisted compression approach that optimizes hyperparameters to simultaneously enhance performance and reduce complexity. Additionally, we introduce four distinct metrics (RMpS, BoP, NABS, and NLGs) to quantify computing complexity in various compression algorithms. These metrics serve as benchmarks for evaluating the relative effectiveness of NN equalizers when compression approaches are employed. The analysis is completed by evaluating the trade-off between compression complexity and performance using simulated and experimental data. By employing optimal compression techniques, we demonstrate the feasibility of designing a simplified NN-based equalizer surpassing the performance of conventional digital back-propagation (DBP) equalizers with only one step per span. This is achieved by reducing the number of multipliers through weighted clustering and pruning algorithms. Furthermore, we highlight that an NN-based equalizer can achieve better performance than the full electronic chromatic dispersion compensation block while maintaining a similar level of complexity. In conclusion, we outline remaining challenges, unanswered questions, and potential avenues for future research in this field.