Approaching the Slepian–Wolf boundary using practical channel codes

Approaching the Slepian–Wolf boundary using practical channel codes

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 po...

Full description

Saved in:
Bibliographic Details
Published in:Signal processing Vol. 86; no. 11; pp. 3096 - 3101
Main Authors: Garcia-Frias, Javier, Cabarcas, Felipe
Format: Journal Article
Language:English
Published: Elsevier B.V 01-11-2006
Subjects:
Correlated sources
Data compression
Turbo codes
Turbo codes
Data compression
Correlated sources
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0165-1684
1872-7557
DOI:10.1016/j.sigpro.2006.03.018