Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2509.01103

On the Resilience of Direction-Shift Keying Against Phase Noise and Short Channel Coherence Time at mmWave Frequencies

Mohaned Chraiti·Ozgur Ercetin·Ali Ghrayeb·Ali Gorcin
View original source ↗Read source document ↗Export metadata ↓

Abstract

The rapid variation of the wireless channel (short channel coherence time) and the phase noise are two prominent concerns in Millimeter-wave (mmWave) and sub-Terahertz systems communication systems. Equalizing the channel effect and tracking the phase noise necessitate dense pilot insertion. Direction-Shift Keying (DSK), a recent variant of Spatial Modulation (SM), addresses these challenges by encoding information in the Direction-of-Arrival (DoA) using a distributed antenna system (DAS), rather than relying on amplitude or phase. DSK has been shown to extend coherence time by up to four orders of magnitude. Despite its promise, existing DSK studies are largely simulation-based and limited to simplified roadside unit scenarios and mobile device (MD) equipped with only two antennas. DSK's performance in general settings, along with the fundamental laws governing its behavior, such as coherence time and resilience to phase noise, remain open problems. In this paper, we derive the structure of the optimal detector for the case of $M$-antenna MD. Then, we establish the governing law for DSK's coherence time, termed the Direction Coherence Time (DCT), defining the the temporal duration over which the DoA remains approximately invariant. We analytically establish that DCT scales with $d/v$ (transmitter-receiver distance over velocity), while the Channel Coherence Time (CCT) scales with $λ/v$, revealing a coherence time gain on the order of $d/λ$ (equivalent to more than four orders of magnitude.) Furthermore, we prove that DSK inherently cancels the phase noise, requiring no additional compensation. Analytical predictions are validated through simulations, confirming the robustness and scalability of DSK in high-frequency mobile environments.

Explore related subjects

cs.ITmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Mohaned Chraiti, Ozgur Ercetin, Ali Ghrayeb, Ali Gorcin. 2025-09-01. On the Resilience of Direction-Shift Keying Against Phase Noise and Short Channel Coherence Time at mmWave Frequencies. https://arxiv.org/abs/2509.01103

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↗