PAPR Reduction in OFDM Systems Using Neural Networks: A Case Study on the Importance of Dataset Generalization
Bianca S. de C. da Silva, Pedro H. C. de Souza, Luciano L. Mendes
TL;DR
The paper addresses the critical need to assess generalization of NN-based PAPR reduction for OFDM by correcting prior data leakage and pilot normalization issues. It demonstrates that with proper train/test separation, the NN generalizes well to unseen OFDM symbols, achieving substantial PAPR reductions with lower inference complexity than the MCSA baseline. The updated results, including larger subcarrier configurations and publicly available code/datasets, reinforce the method's practicality in realistic channel conditions and underscore the importance of dataset handling in data-driven communications research. Overall, the NN-based approach remains effective and computationally advantageous for PAPR control in OFDM systems, supporting its deployment in current and future wireless networks.
Abstract
In [1], we introduced a NN designed to reduce the PAPR in OFDM systems. However, the original study did not include explicit generalization tests to assess how well the NN would perform on previously unseen data, which prevented a comprehensive evaluation of the model's robustness and applicability in diverse scenarios. To address this gap, we conducted additional generalization assessments, the results of which are presented in this case study. These results serve both to complement and to refine the original analysis reported in [1]. Most importantly, the overall conclusions of the initial study remain valid: the NN is still able to reduce the PAPR level to a desired reference value, also with a lower computational cost, confirming the effectiveness and practical applicability of the proposed method across a more generalized setting.
