CVNN-based Channel Estimation and Equalization in OFDM Systems Without Cyclic Prefix
Heitor dos Santos Sousa, Jonathan Aguiar Soares, Kayol Soares Mayer, Dalton Soares Arantes
TL;DR
This paper tackles the spectral efficiency loss in OFDM caused by cyclic prefixes by introducing a complex-valued neural approach for CP-free joint channel estimation and equalization. It proposes a phase-transmittance radial basis function (PT-RBF) CVNN that operates on FFT outputs and sidesteps CP decoding, reducing computational load while maintaining performance. Empirical results show the PT-RBF outperforms traditional LS and MMSE estimators in CP-free scenarios (e.g., improvements of about 2.68 dB and 10.51 dB at a pre-FEC BER of $2\times10^{-2}$), and incurs roughly 30% less real-multiplication complexity than a competing CVNN-based method. The work supports CP-free OFDM viability and suggests FFT keeps outside the neural network to preserve efficiency, with potential applicability to 5G-and-beyond channels and dynamics.
Abstract
In modern communication systems operating with Orthogonal Frequency-Division Multiplexing (OFDM), channel estimation requires minimal complexity with one-tap equalizers. However, this depends on cyclic prefixes, which must be sufficiently large to cover the channel impulse response. Conversely, the use of cyclic prefix (CP) decreases the useful information that can be conveyed in an OFDM frame, thereby degrading the spectral efficiency of the system. In this context, we study the impact of CPs on channel estimation with complex-valued neural networks (CVNNs). We show that the phase-transmittance radial basis function neural network offers superior results, in terms of required energy per bit, compared to classical minimum mean-squared error and least squares algorithms in scenarios without CP.
