On syndrome decoding for Slepian-Wolf coding based on convolutional and turbo codes

Authors:
Lorenzo Cappellari
Affiliations:
Dept. of Information Engineering, University of Padova, Padova, Italy
Venue:
IEEE Communications Letters
Year:
2010

Citing 3
Cited 0

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

DCC '03 Proceedings of the Conference on Data Compression
An efficient SF-ISF approach for the Slepian-wolf source coding problem

EURASIP Journal on Applied Signal Processing
Factor graphs and the sum-product algorithm

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

In source coding, either with or without side information at the decoder, the ultimate performance can be achieved by means of random binning. Structured binning into cosets of performing channel codes has been successfully employed in practical applications. In this letter it is formally shown that various convolutional- and turbo-syndrome decoding algorithms proposed in literature lead in fact to the same estimate. An equivalent implementation is also delineated by directly tackling syndrome decoding as a maximum a posteriori probability problem and solving it by means of iterative message-passing. This solution takes advantage of the exact same structures and algorithms used by the conventional channel decoder for the code according to which the syndrome is formed.