Asynchronous Slepian-Wolf code design

Authors:
Zhibin Sun;Chao Tian;Jun Chen;Kon Max Wong
Affiliations:
Dept. of Electrical and Computer Engineering, McMaster University, Hamilton, ON, Canada;AT&T Labs-Research, Florham Park, NJ;Dept. of Electrical and Computer Engineering, McMaster University, Hamilton, ON, Canada;Dept. of Electrical and Computer Engineering, McMaster University, Hamilton, ON, Canada
Venue:
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
Year:
2009

Citing 7
Cited 0

Totally asynchronous Slepian-Wolf data compression

IEEE Transactions on Information Theory
Elements of information theory

Elements of information theory
Information Theory: Coding Theorems for Discrete Memoryless Systems

Information Theory: Coding Theorems for Discrete Memoryless Systems
Compression with Side Information Using Turbo Codes

DCC '02 Proceedings of the Data Compression Conference
Distributed Code Constructions for the Entire Slepian-Wolf Rate Region for Arbitrarily Correlated Sources

DCC '04 Proceedings of the Conference on Data Compression
On code design for the Slepian-Wolf problem and lossless multiterminal networks

IEEE Transactions on Information Theory
Low-Complexity Approaches to Slepian–Wolf Near-Lossless Distributed Data Compression

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider asynchronous Slepian-Wolf coding where the two encoders may not have completely accurate timing information to synchronize their individual block code boundaries, and propose LDPC code design in this scenario. A new information-theoretic coding scheme based on source splitting is provided, which can achieve the entire asynchronous Slepian-Wolf rate region. Unlike existing methods based on source splitting, the proposed scheme does not require common randomness at the encoder and the decoder, or constructing super-letter from several individual symbols. Furthermore, we show that linear codes are sufficient for each coding step of this scheme. We subsequently design LDPC codes based on this new scheme, by applying the recently discovered source-channel code correspondence. Experimental results validate the effectiveness of the proposed method.