scispace - formally typeset
Journal ArticleDOI

On the joint source-channel decoding of variable-length encoded sources: the BSC case

TLDR
A sequential, finite-delay, joint source-channel decoder that uses a novel state-space to deal with the problem of variable-length source codes in the decoder and is robust to inaccuracies in the estimation of channel statistics.
Abstract
This paper proposes an optimal maximum a posteriori probability decoder for variable-length encoded sources over binary symmetric channels (BSC) that uses a novel state-space to deal with the problem of variable-length source codes in the decoder. This sequential, finite-delay, joint source-channel decoder delivers substantial improvements over the conventional decoder and also over a system that uses a standard forward error correcting code operating at the same over all bit rates. This decoder is also robust to inaccuracies in the estimation of channel statistics.

read more

Citations
More filters
Journal ArticleDOI

Joint Source and Channel Coding

TL;DR: A double low-density parity-check (LDPC) code for JSC coding is proposed and its limiting performance is analyzed by using extrinsic information transfer (EXIT) chart approximations.
Journal ArticleDOI

Soft decoding and synchronization of arithmetic codes: application to image transmission over noisy channels

TL;DR: Models and algorithms are applied to context-based arithmetic coding widely used in practical systems (e.g., JPEG-2000) and reveal very good error resilience performances.
Journal ArticleDOI

Joint source/channel coding and MAP decoding of arithmetic codes

TL;DR: A novel maximum a posteriori (MAP) estimation approach is employed for error correction of arithmetic codes with a forbidden symbol, which improves the performance in terms of error correction with respect to a separated source and channel coding approach based on convolutional codes.
Journal ArticleDOI

Joint source-channel decoding of variable-length codes for convolutional codes and turbo codes

TL;DR: An in-depth analysis of a low-complexity method recently proposed by Guivarch et al., where the redundancy left by a Huffman encoder is used at a bit level in the channel decoder to improve its performance.
Journal ArticleDOI

Joint source-channel turbo coding for binary Markov sources

TL;DR: This work investigates the construction of joint source-channel turbo codes for the reliable communication of binary Markov sources over additive white Gaussian noise and Rayleigh fading channels and shows that the JSC coding system considerably outperforms tandem coding schemes for bit error rates smaller than 10/sup -4/, while enjoying a lower system complexity.
References
More filters
Book

Digital Communications

Digital communications

J.E. Mazo
TL;DR: This month's guest columnist, Steve Bible, N7HPR, is completing a master’s degree in computer science at the Naval Postgraduate School in Monterey, California, and his research area closely follows his interest in amateur radio.
Journal ArticleDOI

Joint source-channel decoding for variable-length encoded data by exact and approximate MAP sequence estimation

TL;DR: The results show that the approximate MAP technique outperforms other approximate methods and provides substantial error protection to variable-length encoded data.
Proceedings ArticleDOI

Joint source/channel coding for variable length codes

N. Demir, +1 more
TL;DR: A technique which utilizes the residual redundancy at the output of the source coder to provide error protection for entropy coded systems at a reduced rate is proposed.
Proceedings ArticleDOI

Iterative source/channel-decoding using reversible variable length codes

R. Bauer, +1 more
TL;DR: A trellis representation of variable length coded data which is capable of being used for bit-level or symbol-level maximum a posteriori (MAP) decoding of variablelength codes (VLC) and results are presented.
Related Papers (5)