Channel estimation based on compressed sensing in high-speed underwater acoustic communication

The underwater acoustic (UA) channel is dispersive in both time and frequency with severe frequency-dependent signal attenuation. Efficient channel estimation and tracking are crucial to coherent high-rate UA communication. In this paper, we propose a new compressed sensing (CS) based channel estimation method with block-by-block channel tracking for UA communication. Compared with conventional channel estimation algorithms, the proposed method efficiently exploits the sparsity of the UA channel, and improves the channel tracking capability of UA communication system. The proposed algorithm was tested during our UA communication experiment conducted in December 2012 in the Indian Ocean off Rottnest Island, Western Australia. At a data rate of 8 kbps (QPSK constellations), average uncoded bit-error-rates (BERs) of 3% and 14% have been achieved over 1 km and 6 km ranges, respectively, using MMSE equalization based on the proposed channel estimation and tracking method

Sparse channel estimation for multicarrier underwater acoustic communication : from subspace methods to compressed sensing

Author Posting. © IEEE, 2009. This article is posted here by permission of IEEE for personal use, not for redistribution. The definitive version was published in IEEE Transactions on Signal Processing 58 (2010): 1708-1721, doi:10.1109/TSP.2009.2038424.In this paper, we investigate various channel estimators that exploit channel sparsity in the time and/or Doppler domain for a multicarrier underwater acoustic system. We use a path-based channel model, where the channel is described by a limited number of paths, each characterized by a delay, Doppler scale, and attenuation factor, and derive the exact inter-carrierinterference (ICI) pattern. For channels that have limited Doppler spread we show that subspace algorithms from the array processing literature, namely Root-MUSIC and ESPRIT, can be applied for channel estimation. For channels with Doppler spread, we adopt a compressed sensing approach, in form of Orthogonal Matching Pursuit (OMP) and Basis Pursuit (BP) algorithms, and utilize overcomplete dictionaries with an increased path delay resolution. Numerical simulation and experimental data of an OFDM block-by-block receiver are used to evaluate the proposed algorithms in comparison to the conventional least-squares (LS) channel estimator.We observe that subspace methods can tolerate small to moderate Doppler effects, and outperform the LS approach when the channel is indeed sparse. On the other hand, compressed sensing algorithms uniformly outperform the LS and subspace methods. Coupled with a channel equalizer mitigating ICI, the compressed sensing algorithms can effectively handle channels with significant Doppler spread.C. Berger, S. Zhou, and P. Willett are supported by ONR grants N00014-09-10613, N00014-07-1-0805, and N00014-09-1-0704

An Iterative Receiver for OFDM With Sparsity-Based Parametric Channel Estimation

In this work we design a receiver that iteratively passes soft information between the channel estimation and data decoding stages. The receiver incorporates sparsity-based parametric channel estimation. State-of-the-art sparsity-based iterative receivers simplify the channel estimation problem by restricting the multipath delays to a grid. Our receiver does not impose such a restriction. As a result it does not suffer from the leakage effect, which destroys sparsity. Communication at near capacity rates in high SNR requires a large modulation order. Due to the close proximity of modulation symbols in such systems, the grid-based approximation is of insufficient accuracy. We show numerically that a state-of-the-art iterative receiver with grid-based sparse channel estimation exhibits a bit-error-rate floor in the high SNR regime. On the contrary, our receiver performs very close to the perfect channel state information bound for all SNR values. We also demonstrate both theoretically and numerically that parametric channel estimation works well in dense channels, i.e., when the number of multipath components is large and each individual component cannot be resolved.Comment: Major revision, accepted for IEEE Transactions on Signal Processin

MMP-DCD-CV based Sparse Channel Estimation Algorithm for Underwater Acoustic Transform Domain Communication System

In this paper, we propose a computationally efficient multipath matching pursuit (MMP) channel estimation algorithm for underwater acoustic (UWA) transform domain communication systems (TDCSs). The algorithm, referred to as the MMP-DCD-CV algorithm, is based on the dichotomous coordinate descent (DCD) iterations and cross validation (CV). The MMP-DCD-CV sparse channel estimator in each iteration searches for multiple promising path candidates most relevant to a residual vector and chooses the best candidate. The DCD iterations are used to solve the corresponding least squares problem with low complexity and numerical stability. The CV provides a stopping criterion of the algorithm without a priori information on the channel sparsity and noise level and examines whether the algorithm overfits its data, thus improving the estimation accuracy. The performance of the proposed algorithm is evaluated under simulated sparse UWA channels. The numerical results show that the algorithm achieves better performance than the original MMP algorithm, has lower complexity, and does not require prior knowledge on the channel sparsity and noise level. We also propose an UWA TDCS with sparse channel estimation based on the proposed MMP-DCD-CV algorithm. The proposed UWA communication system is tested by the Waymark simulator, providing the virtual signal transmission in the UWA channel, with a measured Sound Speed Profile and bathymetry. Numerical results demonstrate that the UWA TDCS with the proposed sparse channel estimator offers considerable improvement in system performance compared to other TDCS schemes

TS-MUWSN: Time synchronization for mobile underwater sensor networks

Time synchronization is an important, yet challenging, problem in underwater sensor networks (UWSNs). This challenge can be attributed to: 1) messaging timestamping; 2) node mobility; and 3) Doppler scale effect. To mitigate these problems, we present an acoustic-based time-synchronization algorithm for UWSN, where we compare several message time-stamping algorithms in addition to different Doppler scale estimators. A synchronization system is based on a bidirectional message exchange between a reference node and a slave one, which has to be synchronized. Therefore, we take as reference the DA-Sync-like protocol (Liu et al., 2014), which takes into account node's movement by using first-order kinematic equations, which refine Doppler scale factor estimation accuracy, and result in better synchronization performance. In our study, we propose to modify both time-stamping and Doppler scale estimation procedures. Besides simulation, we also perform real tests in controlled underwater communication in a water test tank and a shallow-water test in the Mediterranean Sea.Peer ReviewedPostprint (author's final draft

Adaptable underwater networks: The relation between autonomy and communications

This paper discusses requirements for autonomy and communications in maritime environments through two use cases which are sourced from military scenarios: Mine Counter Measures (MCM) and Anti-Submarine Warfare (ASW). To address these requirements, this work proposes a service-oriented architecture that breaks the typical boundaries between the autonomy and the communications stacks. An initial version of the architecture has been implemented and its deployment during a field trial done in January 2019 is reported. The paper discusses the achieved results in terms of system flexibility and ability to address the MCM and ASW requirements