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

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...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on communications 2001-12, Vol.49 (12), p.2052-2055
Main Authors: Subbalakshmi, K.P., Vaisey, J.
Format: Article
Language:English
Subjects:
Bit rate
Channel coding
Channels
Code standards
Compression algorithms
Computer aided software engineering
Decoders
Decoding
Entropy
Error correcting codes
Error correction codes
Optimization
Robustness
Source code
Statistics
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0090-6778
1558-0857
DOI:10.1109/26.974247