Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.