Approaching the Slepian-Wolf boundary using practical channel codes

Authors:
Javier Garcia-Frias;Felipe Cabarcas
Affiliations:
Department of Electrical and Computer Engineering, University of Delaware, Newark, DE;Department of Electrical and Computer Engineering, University of Delaware, Newark, DE
Venue:
Signal Processing - Special section: Distributed source coding
Year:
2006

Citing 8
Cited 2

Distributed Source Coding Using Syndromes (DISCUS): Design and Construction

DCC '99 Proceedings of the Conference on Data Compression
Compression with Side Information Using Turbo Codes

DCC '02 Proceedings of the Data Compression Conference
Joint Source-Channel Decoding of Correlated Sources over Noisy Channels

DCC '01 Proceedings of the Data Compression Conference
Design of Slepian-Wolf Codes by Channel Code Partitioning

DCC '04 Proceedings of the Conference on Data Compression
On Some New Approaches to Practical Slepian-Wolf Compression Inspired by Channel Coding

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

DCC '04 Proceedings of the Conference on Data Compression
LDGM codes for channel coding and joint source-channel coding of correlated sources

EURASIP Journal on Applied Signal Processing
Systematic lossy source/channel coding

IEEE Transactions on Information Theory

Distributed arithmetic coding for the Slepian-Wolf problem

IEEE Transactions on Signal Processing
Fast communication: Lifetime maximized data gathering in wireless sensor networks using limited-order distributed source coding

Signal Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We review the interpretation of the Slepian-Wolf result for compression of correlated sources as a problem of channel coding with side information. Based on this review, we propose a method that allows the use of practical error correcting codes of fixed length to achieve performance close to any point in the Slepian-Wolf boundary without the use of explicit time-sharing arguments. The performance of the proposed approach when turbo codes are utilized is shown by simulations.