DoF of a Cooperative X-Channel with an Application to Distributed Computing - Equipe Communications numériques Access content directly
Conference Papers Year :

DoF of a Cooperative X-Channel with an Application to Distributed Computing

Abstract

We consider a cooperative X-channel with K transmitters (TXs) and K receivers (Rxs) where Txs and Rxs are gathered into groups of size r respectively. Txs belonging to the same group cooperate to jointly transmit a message to each of the K − r Rxs in all other groups, and each Rx individually decodes all its intended messages. By introducing a new interference alignment (IA) scheme, we prove that when K/r is an integer the Sum Degrees of Freedom (Sum-DoF) of this channel is lower bounded by 2r if K/r ∈ {2, 3} and by K(K−r)−r 2 2K−3r if K/r ≥ 4. We also prove that the Sum-DoF is upper bounded by K(K−r) 2K−3r. The proposed IA scheme finds application in a wireless distributed MapReduce framework, where it improves the normalized data delivery time (NDT) compared to the state of the art.
Fichier principal
Vignette du fichier
conference_isit_cr_ver2.pdf (434.33 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03700925 , version 1 (21-06-2022)

Identifiers

  • HAL Id : hal-03700925 , version 1

Cite

Yue Bi, Philippe Ciblat, Michèle Wigger, Yue Wu. DoF of a Cooperative X-Channel with an Application to Distributed Computing. IEEE International Symposium on Information Theory (ISIT), Jun 2022, Helsinki, Finland. ⟨hal-03700925⟩
116 View
11 Download

Share

Gmail Facebook Twitter LinkedIn More