Message Passing-Based Impulsive Noise Mitigation and Channel Estimation for Underwater Acoustic OFDM Communications

The impulsive noise and the time-varying channel are two major detrimental factors which greatly constrain the performance of underwater acoustic communications (UACs). Utilizing the joint sparsity of the impulsive noise and the channel impulse response, the paper proposes the generalized approximate message passing (GAMP)-based sparse Bayesian learning (SBL) frameworks for joint impulsive noise mitigation and channel estimation and tracking for orthogonal frequency division multiplexing (OFDM) UACs. Firstly, the SBL framework for the joint estimation is employed. To reduce the computational complexity, the GAMP is introduced into the expectation-maximization (EM) algorithm, and a low-complexity GAMP based SBL framework is formulated without performance degradation. To further estimate and track the impulsive noise and channel state information in the slow time-varying scenarios, we propose a novel GAMP-based temporal SBL framework. The factor graph and GAMP are used to achieve the approximated estimation for the posterior statistics of both the channel state information and the impulsive noise. The algorithm formulates the message passing scheduling for the EM algorithm to solve the joint multiple sparse signal recovery problem. Simulations and sea-trial results demonstrate that the proposed algorithms significantly improve the performance in terms of the mean square error of channel estimation, impulsive noise estimation, bit error rate and computational complexity compared with their corresponding SBL-based counterparts.

Automated summary

This paper proposes a new framework based on sparse Bayesian learning and generalized approximate message passing for joint impulsive noise mitigation and channel estimation. The GAMP algorithm is introduced to reduce computational complexity, and a novel GAMP-based temporal framework is proposed for slow time-varying scenarios. Simulation and sea-trial results demonstrate the superiority of the proposed algorithms compared to existing methods in terms of multiple performance metrics.