Search arXivSearch

arXiv · 2206.02109

Delay Alignment Modulation: Manipulating Channel Delay Spread for Efficient Single- and Multi-Carrier Communication

Abstract

The evolution of mobile communication networks has always been accompanied by the advancement of ISI mitigation techniques, from equalization in 2G, spread spectrum and RAKE receiver in 3G, to OFDM in 4G and 5G. Looking forward towards 6G, by exploiting the high spatial resolution brought by large antenna arrays and the multi-path sparsity of mmWave and Terahertz channels, a novel ISI mitigation technique termed delay alignment modulation (DAM) was recently proposed. However, existing works only consider the single-carrier perfect DAM, which is feasible only when the number of BS antennas is no smaller than that of channel paths, so that all multi-path signal components arrive at the receiver simultaneously and constructively. This imposes stringent requirements on the number of BS antennas and multi-path sparsity. In this paper, we propose a generic DAM technique to manipulate the channel delay spread via spatial-delay processing, thus providing a flexible framework to combat channel time dispersion for efficient single- or multi-carrier transmissions. We first show that when the number of BS antennas is much larger than that of channel paths, perfect delay alignment can be achieved to transform the time-dispersive channel to time non-dispersive channel with the simple delay pre-compensation and path-based MRT beamforming. When perfect DAM is infeasible or undesirable, the proposed generic DAM technique can be applied to significantly reduce the channel delay spread. We further propose the novel DAM-OFDM technique, which is able to save the CP overhead or mitigate the PAPR issue suffered by conventional OFDM. We show that the proposed DAM-OFDM involves joint frequency- and time-domain beamforming optimization, for which a closed-form solution is derived. Simulation results show that the proposed DAM-OFDM outperforms the conventional OFDM in terms of spectral efficiency, BER and PAPR.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Haiquan Lu, Yong Zeng. 2023-08-15. Delay Alignment Modulation: Manipulating Channel Delay Spread for Efficient Single- and Multi-Carrier Communication. https://arxiv.org/abs/2206.02109

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

KEEP EXPLORING

Related papers

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

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

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