Skip to Main content Skip to Navigation
Conference papers

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.
Complete list of metadata
Contributor : Michèle Wigger Connect in order to contact the contributor
Submitted on : Wednesday, June 22, 2022 - 6:06:26 PM
Last modification on : Wednesday, June 29, 2022 - 4:47:34 PM
Long-term archiving on: : Friday, September 23, 2022 - 7:07:04 PM


Files produced by the author(s)


  • HAL Id : hal-03702135, version 1


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



Record views


Files downloads