On the capacity of erasure relay channel: Multi-relay case - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2005

On the capacity of erasure relay channel: Multi-relay case

Ramin Khalili
  • Fonction : Auteur
  • PersonId : 987294
Kavé Salamatian
  • Fonction : Auteur
  • PersonId : 966432

Résumé

We consider here a single sender-destination multi-relay channel. The links connecting the nodes are supposed to be erasure where symbols are received correctly without any error, or lost. We consider that the nodes are not able to use any interference cancellation mechanism. The interference might be suppressed through using separated physical channel or thought a time-sharing mechanism. This model is realistic for many practical scenarios in the context of wireless networks. In previous works, the capacity region of broadcast erasure channels as well as the capacity of the single-sender relay channel (under degraded and non-degraded hypothesis) has been derived. This paper extends the previous results to the more general case of multi-relay channels. We derive the cut-set bound for a general (stationary ergodic) multi-relay erasure channel, and we show that it can be reached through a practical linear coding scheme based on MDS codes.

Dates et versions

hal-01488418 , version 1 (13-03-2017)

Identifiants

Citer

Ramin Khalili, Kavé Salamatian. On the capacity of erasure relay channel: Multi-relay case. ITW 2005 - Information Theory Workshop, Aug 2005, Rotorua, New Zealand. ⟨10.1109/ITW.2005.1531866⟩. ⟨hal-01488418⟩
132 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More