Self-Interference Channel Estimation Algorithm Based on Maximum-Likelihood Estimator in In-Band Full-Duplex Underwater Acoustic Communication System
Author(s) -
Gang Qiao,
Shuwei Gan,
Songzuo Liu,
Qingjun Song
Publication year - 2018
Publication title -
ieee access
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.587
H-Index - 127
ISSN - 2169-3536
DOI - 10.1109/access.2018.2875916
Subject(s) - aerospace , bioengineering , communication, networking and broadcast technologies , components, circuits, devices and systems , computing and processing , engineered materials, dielectrics and plasmas , engineering profession , fields, waves and electromagnetics , general topics for engineers , geoscience , nuclear engineering , photonics and electrooptics , power, energy and industry applications , robotics and control systems , signal processing and analysis , transportation
To efficiently cancel the self-interference (SI) caused by the simultaneous transmission and reception in in-band full-duplex (IBFD) underwater acoustic (UWA) communication system, we propose a novel channel estimation approach to estimate the sparse SI channel, the proposed channel estimation algorithm has a better estimation performance than the traditional channel estimator. In the IBFD radio communication system, the SI and intended channels are estimated through using training symbols in different time slots, and therefore, the effect of intended signal can be avoided in SI channel estimation. Because of the time variable and longtime delay in the UWA channel, we cannot estimate the SI and intended channel in different time slots. The intended signal is treated as additive noise when estimating SI channel in the IBFD-UWA communication system, and thus, the SI channel estimation is affected by non-Gaussian noise and the traditional algorithms designed for Gaussian noise typically perform poor. In view of this situation, we propose a maximum likelihood (ML) with sparse constraint to estimate the sparse SI channel. The ML with sparse constraint is derived via combining a sparse constraint into conventional ML cost function and using stochastic gradient algorithm to get the iterative formula, thereby resulting in a better performance. Extensive simulations and experimental results show that the proposed algorithm has faster convergence and better cancellation performance compared with traditional ML and least square. We also present the convergence and steady-state mean-squared error analysis of the proposed algorithm.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom