On the Mobile-to-Mobile Linear Time-Variant Shallow-Water Acoustic Channel Response

Adrián Sauco-Gallardo; Unai Fernández-Plazaola; Luis Díez

Home/Archive/arXiv

arXiv · 1605.05861

On the Mobile-to-Mobile Linear Time-Variant Shallow-Water Acoustic Channel Response

Adrián Sauco-Gallardo·Unai Fernández-Plazaola·Luis Díez

View original source ↗Read source document ↗Export metadata ↓

Abstract

We expose some concepts concerning the channel impulse response (CIR) of linear time-varying (LTV) channels to give a proper characterization of the mobile-to-mobile underwater channel. We find different connections between the linear time-invariant (LTI) CIR of the static channel and two definitions of LTV CIRs of the dynamic mobile-to-mobile channel. These connections are useful to design a dynamic channel simulator from the static channel models available in the literature. Such feature is particularly interesting for overspread channels, which are hard to characterize by a measuring campaign. Specifically, the shallow water acoustic (SWA) channel is potentially overspread due the signal low velocity of propagation which prompt long delay spread responses and great Doppler effect. Furthermore, from these connections between the LTI static CIRs and the LTV dynamic CIRS, we find that the SWA mobile-to-mobile CIR does not only depend on the relative velocity between transceivers, but also on the absolute velocity of each of them referred to the velocity of propagation. Nevertheless, publications about this topic do not consider it and formulate their equations in terms of the relative velocity between transceivers. We illustrate our find using two couples of examples where, even though the relative velocity between the mobiles is the same, their CIRs are not.

Explore related subjects

cs.IT math.IT

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Adrián Sauco-Gallardo, Unai Fernández-Plazaola, Luis Díez. 2017-04-25. On the Mobile-to-Mobile Linear Time-Variant Shallow-Water Acoustic Channel Response. https://arxiv.org/abs/1605.05861

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Bistatic Target Detection by Exploiting Both Deterministic Pilots and Unknown Random Data Payloads

Integrated sensing and communication (ISAC) plays a crucial role in 6G, to enable innovative applications such as drone surveillance, urban air mobility, and low-altitude logistics. However, the hybrid ISAC signal, which comprises deterministic pilot and random data payload components, poses challenges for target detection due to two reasons: 1) these two components cause coupled shifts in both the mean and variance of the received signal, and 2) the random data payloads are typically unknown to the sensing receiver in the bistatic setting. Unfortunately, these challenges could not be tackled by existing target detection algorithms. In this paper, a generalized likelihood ratio test (GLRT)-based detector is derived, by leveraging the known deterministic pilots and the statistical characteristics of the unknown random data payloads. Due to the analytical intractability of exact performance characterization, we perform an asymptotic analysis for the false alarm probability and detection probability of the proposed detector. The results highlight a critical trade-off: both deterministic and random components improve detection reliability, but the latter also brings statistical uncertainty that hinders detection performance. Simulations validate the theoretical findings and demonstrate the effectiveness of the proposed detector, which highlights the necessity of designing a dedicated detector to fully exploited the signaling resources assigned to random data payloads.

cs.IT↗

arXiv2026

On Unbiased Parameter Estimation and Signal Reconstruction

In this paper, we extend the theory of depth-unbiased source localization to unbiased parameter estimation and signal reconstruction for an arbitrary number of non-zero parameters. The topic touches on exact reconstructibility, most commonly studied in compressed sensing and multisource estimation across various imaging problems. The theoretical results derive upper bounds on the number of recoverable parameters in the noiseless case, and define a probability measure to assess the likelihood of recovering all non-zero parameters with correct magnitude order. The work provides a mathematical explanation of the open question regarding the noise robustness of standardized and unbiased methods. The paper also reveals a trade-off between the number of sensors and the signal-to-noise ratio. Numerical experiments demonstrate the theoretical findings.

cs.IT↗

arXiv2026

Minimum enclosing Bregman balls made easy

In this work, we revisit the problem of computing minimum enclosing Bregman balls (Bregman MEBs) of finite sets of parameters. First, we show that Bregman MEBs are equivalent to MEBs of corresponding weighted point sets with respect to the power distance. We then report an efficient Frank--Wolfe $(1+ε)$-approximation algorithm for computing power MEBs, for any $ε>0$. This power MEB approximation algorithm coincides with the Bregman MEB approximation algorithm of Nock and Nielsen (2005) when expressed in the dual gradient space. Finally, we show that the Bregman potential lifting transforms used to construct Bregman Voronoi diagrams can be reinterpreted as the classical paraboloid lifting transform applied to corresponding weighted point sets. In particular, Bregman MEB circumcenters lie on the farthest Bregman Voronoi diagrams or equivalently on the corresponding farthest power diagrams.

cs.IT↗