Search arXivSearch

arXiv · 1905.03761

Deep Learning for TDD and FDD Massive MIMO: Mapping Channels in Space and Frequency

Abstract

Can we map the channels at one set of antennas and one frequency band to the channels at another set of antennas---possibly at a different location and a different frequency band? If this channel-to-channel mapping is possible, we can expect dramatic gains for massive MIMO systems. For example, in FDD massive MIMO, the uplink channels can be mapped to the downlink channels or the downlink channels at one subset of antennas can be mapped to the downlink channels at all the other antennas. This can significantly reduce (or even eliminate) the downlink training/feedback overhead. In the context of cell-free/distributed massive MIMO systems, this channel mapping can be leveraged to reduce the fronthaul signaling overhead as only the channels at a subset of the distributed terminals need to be fed to the central unit which can map them to the channels at all the other terminals. This mapping can also find interesting applications in mmWave beam prediction, MIMO radar, and massive MIMO based positioning. In this paper, we introduce the new concept of channel mapping in space and frequency, where the channels at one set of antennas and one frequency band are mapped to the channels at another set of antennas and frequency band. First, we prove that this channel-to-channel mapping function exists under the condition that the mapping from the candidate user positions to the channels at the first set of antennas is bijective; a condition that can be achieved with high probability in several practical MIMO communication scenarios. Then, we note that the channel-to-channel mapping function, even if it exists, is typically unknown and very hard to characterize analytically as it heavily depends on the various elements of the surrounding environment. With this motivation, we propose to leverage the powerful learning capabilities of deep neural networks ....

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Muhammad Alrabeiah, Ahmed Alkhateeb. 2019-08-14. Deep Learning for TDD and FDD Massive MIMO: Mapping Channels in Space and Frequency. https://arxiv.org/abs/1905.03761

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