Hamming Distance Optimized Underwater Acoustic OTFS-IM Systems

نویسندگان

چکیده

The orthogonal time frequency space (OTFS) modulation technique can provide reliable communication in time-varying channels. Due to the dispersive characteristics of underwater acoustic channels, this paper proposes an OTFS-IM system based on Hamming distance optimization reduce impact dispersion communication. Firstly, is introduced, which introduces index into Delay–Doppler (DD) domain make OTFS have stronger anti-Delay–Doppler capability. In contrast, since there sequence redundancy a specific combination, model used eliminate redundant combination and further improve bit error rate performance system. addition, optimized verified by simulation analysis. results show that proposed achieve more performance.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Novel Optimized Approach for Underwater Acoustic (UWA) Cooperative Communication Systems to Achieve Delay Diversity

The communication through water is different scenario from the communication on the land, while transmission through the water the delays are frequently happens when the signals received from geographically separated nodes. Moreover, UWA communications enable high motion agility and flexibility of the nodes, and allow interactive system query and instantaneous system response. The UWA environme...

متن کامل

Random Access for Underwater Acoustic Cellular Systems

In this paper, a random access preamble (RAP) design technique for underwater acoustic cellular systems is proposed. After showing that the conventional RAP used in long term evolution (LTE) systems is not appropriate for underwater acoustic cellular systems, two different types of RAPs (RAP 1 and RAP 2) are proposed to detect the identity of underwater equipment/nodes (UEs) and estimate the ti...

متن کامل

Hamming distance for conjugates

Let x, y be strings of equal length. The Hamming distance h(x, y) between x and y is the number of positions in which x and y differ. If x is a cyclic shift of y, we say x and y are conjugates. We consider f(x, y), the Hamming distance between the conjugates xy and yx. Over a binary alphabet f(x, y) is always even, and must satisfy a further technical condition. By contrast, over an alphabet of...

متن کامل

Hamming Distance Metric Learning

Motivated by large-scale multimedia applications we propose to learn mappings from high-dimensional data to binary codes that preserve semantic similarity. Binary codes are well suited to large-scale applications as they are storage efficient and permit exact sub-linear kNN search. The framework is applicable to broad families of mappings, and uses a flexible form of triplet ranking loss. We ov...

متن کامل

On Computing the Hamming Distance

Methods for the fast computation of Hamming distance developed for the case of large number of pairs of words are presented and discussed in the paper. The connection of this subject to some questions about intersecting sets and Hadamard designs is also considered.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Entropy

سال: 2023

ISSN: ['1099-4300']

DOI: https://doi.org/10.3390/e25070972