scispace - formally typeset
Open AccessJournal ArticleDOI

Compressed Sensing of Delay and Doppler Spreading in Underwater Acoustic Channels

TLDR
An efficient compressed sensing method to solve the measurements of delay and Doppler spreading in underwater acoustic channels (UACs) by inserting a projection matrix that adopts QR decomposition for an efficient computation is proposed.
Abstract
The measurements of delay and Doppler (DD) spreading in underwater acoustic channels (UACs) have multiple applications, including communications as well as the development of a dynamic UAC simulator. However, these measurements suffer from the difficulties of fast time variations and large data sets. This paper addresses an efficient compressed sensing (CS) method to solve these problems. First, the DD spreading in UACs is studied by using a doubly spread model; second, the least-square criterion is implemented and its limit is analyzed. Subsequently, the matching pursuit (MP) method is applied to the problem by exploiting the sparsity of the DD model-based UACs. Although the MP method improves the performance of the LS method, it has unavoidable deficiencies, e.g., the redundant selections of bases that lead to a limited measurement of DD spreading. Thus, this paper proposes an improved version by inserting a projection matrix. The projected MP (PMP) method adopts QR decomposition for an efficient computation. Finally, at-sea data-based comparisons among the abovementioned three methods are conducted to verify the superiority of the PMP method.

read more

Citations
More filters
Journal ArticleDOI

Sparse Estimator With $\ell_0$ -Norm Constraint Kernel Maximum-Correntropy-Criterion

TL;DR: The proposed KMCC-L0 method is used for identifying and tracking for unknown sparse systems and the simulation results confirm its superior performance.
Journal ArticleDOI

A blocked MCC estimator for group sparse system identification

TL;DR: A mixed norm constraint in the objective function is integrated into the cost function of the varied kernel MCC method and derives block sparse MCC (BSMCC) method and extends BSMCC method to an optimal version by choosing the adequate block size.
Journal ArticleDOI

Channel Estimation and Equalization for Alamouti SF-Coded OFDM-UWA Communications

TL;DR: In this article, a non-data-aided, expectation-maximization (EM)-based maximum a posteriori probability sparse channel estimation was proposed for underwater acoustic (UWA) communications.
Journal ArticleDOI

Efficient interpolation based OMP for sparse channel estimation in underwater acoustic OFDM

TL;DR: Based on the existing frequency estimation algorithms, two novel interpolation based OMP methods for baseband sampling grid and over-sampling grid respectively are proposed, aiming at improving path delay estimation efficiency.
References
More filters
Journal ArticleDOI

LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares

TL;DR: Numerical tests are described comparing I~QR with several other conjugate-gradient algorithms, indicating that I ~QR is the most reliable algorithm when A is ill-conditioned.
Journal ArticleDOI

Characterization of Randomly Time-Variant Linear Channels

TL;DR: Several new canonical channel models are derived in this paper, some of which are dual to those of Kailath, and a model called the Quasi-WSSUS channel is presented to model the behavior of such channels.
BookDOI

Compressed sensing : theory and applications

TL;DR: In this paper, the authors introduce the concept of second generation sparse modeling and apply it to the problem of compressed sensing of analog signals, and propose a greedy algorithm for compressed sensing with high-dimensional geometry.
Journal ArticleDOI

Sparse channel estimation via matching pursuit with application to equalization

TL;DR: It is shown how an estimate of the channel may be obtained using a matching pursuit (MP) algorithm and this estimate is compared to thresholded variants of the least squares channel estimate.
Proceedings ArticleDOI

Sparsity adaptive matching pursuit algorithm for practical compressed sensing

TL;DR: This paper presents a novel iterative greedy reconstruction algorithm for practical compressed sensing, called the sparsity adaptive matching pursuit, which provides a generalized greedy reconstruction framework in which the orthogonal matching pursuit and the subspace pursuit can be viewed as its special cases.
Related Papers (5)