• DocumentCode
    2984532
  • Title

    Reliable source transmission over relay networks with Side Information

  • Author

    Sefidgaran, Milad ; Akhbari, Bahareh ; Mohsenzadeh, Valda ; Aref, Mohammad Reza

  • Author_Institution
    Electr. Eng. Dept., Sharif Univ. of Technol., Tehran, Iran
  • fYear
    2009
  • fDate
    June 28 2009-July 3 2009
  • Firstpage
    699
  • Lastpage
    703
  • Abstract
    In this paper, we consider reliable transmission of a discrete memoryless source over multi-relay networks with correlated side information (SI) available at the relay nodes and the final receiver. We obtain a necessary condition for reliable source transmission over a multi-terminal network with SI, which results in a necessary condition for a multi-relay network with SI, as a special case. We also propose a separate source-channel coding scheme, and based on it, a sufficient condition for a multi-relay network with SI is derived. Based on a partitioning method and the nature of a degraded relay network, we propose another coding scheme which results in a sufficient condition for a degraded relay network with SI. We show that these proposed schemes which are based on operational separation, achieve the same rates as the joint source-channel codes and these sufficient conditions are indeed necessary conditions for the degraded relay networks with degraded SI.
  • Keywords
    combined source-channel coding; radio networks; telecommunication network reliability; discrete memoryless source; final receiver; joint source-channel codes; multirelay networks; multiterminal network; operational separation; relay nodes; side information; source transmission reliability; Channel coding; Contracts; Decoding; Degradation; Information security; Information systems; Propagation losses; Relays; Source coding; Sufficient conditions;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory, 2009. ISIT 2009. IEEE International Symposium on
  • Conference_Location
    Seoul
  • Print_ISBN
    978-1-4244-4312-3
  • Electronic_ISBN
    978-1-4244-4313-0
  • Type

    conf

  • DOI
    10.1109/ISIT.2009.5205672
  • Filename
    5205672