Distributed Compression of Binary Sources Using Conventional Parallel and Serial Concatenated Convolutional Codes

Authors:
Angelos D. Liveris;Zixiang Xiong;Costas N. Georghiades
Affiliations:
-;-;-
Venue:
DCC '03 Proceedings of the Conference on Data Compression
Year:
2003

Citing 0
Cited 11

Collecting correlated information from a sensor network

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Asymmetric joint source-channel coding for correlated sources with blind HMM estimation at the receiver

EURASIP Journal on Wireless Communications and Networking
Lower bounds for asymmetric communication channels and distributed source coding

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
A general and optimal framework to achieve the entire rate region for Slepian-Wolf coding

Signal Processing - Special section: Distributed source coding
An efficient SF-ISF approach for the Slepian-wolf source coding problem

EURASIP Journal on Applied Signal Processing
Distributed source coding techniques for lossless compression of hyperspectral images

EURASIP Journal on Applied Signal Processing
A flexible rate Slepian-Wolf code construction

IEEE Transactions on Communications
Distributed arithmetic coding for the Slepian-Wolf problem

IEEE Transactions on Signal Processing
Geometry-driven distributed compression of the plenoptic function: performance bounds and constructive algorithms

IEEE Transactions on Image Processing
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
On syndrome decoding for Slepian-Wolf coding based on convolutional and turbo codes

IEEE Communications Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show how conventional parallel (turbo) and serial concatenated convolutionalcodes can be used to compress close to the Slepian-Wolf limit ofr correlated binarysources.Conventional refers to codes already used in channel coding.Focusing on the asymmetric case of compression of an equiprobable memoryless binary source withside information at the decoder, the approach is based on modeling the correlation asa channel and using syndromes.The encoding and decoding procedures are explainedin detail.The performance achieved is seen to be better than recently publishedresults using nonconventional turbo codes and very close to the Slepian-Wolf limit.