Orthogonal frequency division multiplexing (OFDM) is adopted in most wireless communication systems, and the performance of OFDM is affected by impulse noise (IN). Better channel estimation (CE) performance is required to detect the channel information on the receiving side. The OFDM system is considered with the number of subcarriers carrying the data and pilot symbols. In the OFDM modulator, the symbols of the frequency domain are transformed into the signals of the time domain using inverse discrete Fourier transformation (IDFT). Effective impulsive noise mitigation is crucial for improving the effectiveness of OFDM communication systems, and it improves the signal-to-noise ratio (SNR) at the receiver. A cyclic prefix is then appended before transmission through the channel. In the receiver noise, the effect of IN is mitigated jointly with CE using the Bayesian matching pursuit (BMP) and Moth-flame algorithm (MFA). In this approach, the IN and channel information is considered as a sparse vector. Here, the data symbols used are considered an unknown parameter. The approach incorporating all subcarriers has a lower mean square error (MSE) of IN estimate for impulsive noise reduction. The MFA algorithm is used to optimize the sensor matrix in BMP. The sparsity of the channel and the impulse response are observed in the time domain to represent the channel and IN together. It exactly recovers the sparse signal for finding the convex objectives of the sparse minimizer, and the sparse solution is obtained with fixed point updates. The proposed BMP algorithm improves the CE by explicitly considering the existence of IN. The BMP is a greedy algorithm that selects the most correlated residuals at each column. Under mutual incoherence, it recovers the signal with a higher probability. The simulated outcomes proved that the proposed CE and noise mitigation model achieved better performance based on the bit error rate (BER), throughput and MSE.
Read full abstract