Distributed coding using punctured quasi-arithmetic codes for memory and memoryless sources

Authors:
Simon Malinowski;Xavi Artigas;Christine Guillemot;Luis Torres
Affiliations:
IRISA/INRIA, Rennes Cedex, France;Technical University of Catalunya, Barcelona, Spain;IRISA/INRIA, Rennes Cedex, France;Technical University of Catalunya, Barcelona, Spain
Venue:
IEEE Transactions on Signal Processing
Year:
2009

Citing 6
Cited 0

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
Rate-adaptive codes for distributed source coding

Signal Processing - Special section: Distributed source coding
Soft and joint source-channel decoding of quasi-arithmetic codes

EURASIP Journal on Applied Signal Processing
Lossless and near-lossless source coding for multiple access networks

IEEE Transactions on Information Theory
Rate-compatible punctured low-density parity-check codes with short block lengths

IEEE Transactions on Information Theory

Quantified Score

Hi-index	35.68

Visualization

Abstract

This correspondence considers the use of punctured quasi-arithmetic (QA) codes for the Slepian-Wolf problem. These entropy codes are defined by finite state machines for memoryless and first-order memory sources. Puncturing an entropy coded bit-stream leads to an ambiguity at the decoder side. The decoder makes use of a correlated version of the original message in order to remove this ambiguity. A complete distributed source coding (DSC) scheme based on QA encoding with side information at the decoder is presented, together with iterative structures based on QA codes. The proposed schemes are adapted to memoryless and first-order memory sources. Simulation results reveal that the proposed schemes are efficient in terms of decoding performance for short sequences compared to well-known DSC solutions using channel codes.