Slepian-Wolf Coding for Nonuniform Sources Using Turbo Codes

Authors:
Jing (Tiffany) Li;Zhenyu Tu;Rick S. Blum
Affiliations:
-;-;-
Venue:
DCC '04 Proceedings of the Conference on Data Compression
Year:
2004

Citing 0
Cited 4

An efficient SF-ISF approach for the Slepian-wolf source coding problem

EURASIP Journal on Applied Signal Processing
Geometry-driven distributed compression of the plenoptic function: performance bounds and constructive algorithms

IEEE Transactions on Image Processing
The equivalence between Slepian-Wolf coding and channel coding under density evolution

IEEE Transactions on Communications
Unequal error protection based on symmetric Slepian-Wolf coding in wireless sensor network

WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The recently proposed turbo-binning scheme is shown to be both efficient and optimal foruniform source Slepian-Wolf coding problem. This paper studies the case when sources arei.i.d but nonuniformly distributed. It is firstly shown that any algebraic binning scheme basedon linear codes is optimal for nonuniform sources only asymptotically. Next two modificationsare proposed to improve the performance of the turbo-binning scheme for nonuniform sources.The first is to carefully design the constituent encoder structures to maximally match the turbocode to the nonuniform source distribution, and the second is to use variable-length syndromesequences to index the bins. Simulations show that the combination of both strategies can lead to an improvement of as much as 0.22 bit/symbol in overall compression rate for highly nonuniform sources.