On practical design for joint distributed source and network coding

Y. Wu, V. Stankovic, Z. Xiong, S. Kung

Research output: Contribution to journalArticle

21 Citations (Scopus)

Abstract

This paper considers the problem of communicating correlated information from multiple source nodes over a network of noiseless channels to multiple destination nodes, where each destination node wants to recover all sources. The problem involves a joint consideration of distributed compression and network information relaying. Although the optimal rate region has been theoretically characterized, it was not clear how to design practical communication schemes with low complexity. This work provides a partial solution to this problem by proposing a low-complexity scheme for the special case with two sources whose correlation is characterized by a binary symmetric channel. Our scheme is based on a careful combination of linear syndrome-based Slepian-Wolf coding and random linear mixing (network coding). It is in general suboptimal; however, its low complexity and robustness to network dynamics make it suitable for practical implementation.
LanguageEnglish
Pages1709-1720
Number of pages12
JournalIEEE Transactions on Information Theory
Volume55
Issue number4
DOIs
Publication statusPublished - Apr 2009

Fingerprint

Network coding
coding
Communication
communication

Keywords

  • network coding
  • distributed source coding
  • distributed compression
  • multicast
  • low complexity

Cite this

@article{397888dda583473d9cff1f7ff9687bf3,
title = "On practical design for joint distributed source and network coding",
abstract = "This paper considers the problem of communicating correlated information from multiple source nodes over a network of noiseless channels to multiple destination nodes, where each destination node wants to recover all sources. The problem involves a joint consideration of distributed compression and network information relaying. Although the optimal rate region has been theoretically characterized, it was not clear how to design practical communication schemes with low complexity. This work provides a partial solution to this problem by proposing a low-complexity scheme for the special case with two sources whose correlation is characterized by a binary symmetric channel. Our scheme is based on a careful combination of linear syndrome-based Slepian-Wolf coding and random linear mixing (network coding). It is in general suboptimal; however, its low complexity and robustness to network dynamics make it suitable for practical implementation.",
keywords = "network coding, distributed source coding, distributed compression, multicast, low complexity",
author = "Y. Wu and V. Stankovic and Z. Xiong and S. Kung",
year = "2009",
month = "4",
doi = "10.1109/TIT.2009.2013016",
language = "English",
volume = "55",
pages = "1709--1720",
journal = "IEEE Transactions on Information Theory",
issn = "0018-9448",
number = "4",

}

On practical design for joint distributed source and network coding. / Wu, Y.; Stankovic, V.; Xiong, Z.; Kung, S.

In: IEEE Transactions on Information Theory, Vol. 55, No. 4, 04.2009, p. 1709-1720.

Research output: Contribution to journalArticle

TY - JOUR

T1 - On practical design for joint distributed source and network coding

AU - Wu, Y.

AU - Stankovic, V.

AU - Xiong, Z.

AU - Kung, S.

PY - 2009/4

Y1 - 2009/4

N2 - This paper considers the problem of communicating correlated information from multiple source nodes over a network of noiseless channels to multiple destination nodes, where each destination node wants to recover all sources. The problem involves a joint consideration of distributed compression and network information relaying. Although the optimal rate region has been theoretically characterized, it was not clear how to design practical communication schemes with low complexity. This work provides a partial solution to this problem by proposing a low-complexity scheme for the special case with two sources whose correlation is characterized by a binary symmetric channel. Our scheme is based on a careful combination of linear syndrome-based Slepian-Wolf coding and random linear mixing (network coding). It is in general suboptimal; however, its low complexity and robustness to network dynamics make it suitable for practical implementation.

AB - This paper considers the problem of communicating correlated information from multiple source nodes over a network of noiseless channels to multiple destination nodes, where each destination node wants to recover all sources. The problem involves a joint consideration of distributed compression and network information relaying. Although the optimal rate region has been theoretically characterized, it was not clear how to design practical communication schemes with low complexity. This work provides a partial solution to this problem by proposing a low-complexity scheme for the special case with two sources whose correlation is characterized by a binary symmetric channel. Our scheme is based on a careful combination of linear syndrome-based Slepian-Wolf coding and random linear mixing (network coding). It is in general suboptimal; however, its low complexity and robustness to network dynamics make it suitable for practical implementation.

KW - network coding

KW - distributed source coding

KW - distributed compression

KW - multicast

KW - low complexity

U2 - 10.1109/TIT.2009.2013016

DO - 10.1109/TIT.2009.2013016

M3 - Article

VL - 55

SP - 1709

EP - 1720

JO - IEEE Transactions on Information Theory

T2 - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

SN - 0018-9448

IS - 4

ER -