scispace - formally typeset
Proceedings ArticleDOI

Robust transmission of variable-length encoded sources

A.H. Murad, +1 more
- Vol. 2, pp 968-972
Reads0
Chats0
TLDR
Simulation results presented show that the proposed techniques can result in significant improvement in decoding performance, and are extended to address the problem of error propagation, an inherent problem with using VLCs.
Abstract
Digital communications systems commonly use compression (source coding) and error control (channel coding) to allow efficient and robust transmission of data over noisy channels. When compression is imperfect, some residual redundancy remains in the transmitted data and can be exploited at the decoder to improve the decoder's probability-of-error performance. A new approach to joint source-channel maximum a posteriori probability (MAP) decoding applicable to systems employing variable-length source codes (VLCs) was previously developed by the authors-the resulting joint decoder's structure is similar to that of the conventional Viterbi decoder. This paper extends the authors' previous work to address the problem of error propagation, an inherent problem with using VLCs. Options considered include list decoding, trellis-pruning, and composite schemes. Simulation results presented show that the proposed techniques can result in significant improvement in decoding performance.

read more

Citations
More filters
Proceedings ArticleDOI

On variable length codes for iterative source/channel decoding

TL;DR: A bit-level soft-in/soft-out decoder based on this trellis is used as an outer component decoder in an iterative decoding scheme for a serially concatenated source/channel coding system.
Journal ArticleDOI

Joint source/channel coding using arithmetic codes

TL;DR: This joint source/channel coder design provides significant packet loss recovery with minimal rate overhead, and compares favorably with conventional schemes.
Patent

Method of decoding a variable-length codeword sequence

TL;DR: In this article, a method of source decoding variable-length codeword sequences is proposed, which is based on an associated state diagram comprising a plurality of states (S) and on a code (C).
Book

Joint Source Channel Coding Using Arithmetic Codes

TL;DR: This paper shows how to use this capability using a sequential decoder structure to provide powerful error correction capability, and provides significant packet loss recovery with minimal overhead.
Proceedings ArticleDOI

Huffman tree based metric derivation for a low-complexity sequential soft VLC decoding

TL;DR: A new soft VLC decoding algorithm based on a sequential decoding technique that is very efficient in terms of decoding complexity that is evaluated on the well-known "Foreman" video sequence.
References
More filters
Journal ArticleDOI

List Viterbi decoding algorithms with applications

TL;DR: A list Viterbi decoding algorithm (LVA) that produces a rank ordered list of the L globally best candidates after a trellis search and a serial LVA that iteratively produces the k/sup th/ best candidate based on knowledge of the previously found k-1 best paths is presented.
Journal ArticleDOI

Use of residual redundancy in the design of joint source/channel coders

TL;DR: A technique for providing error protection without the additional overhead required for channel coding is presented, and is applied to image coding using differential pulse code modulation (DPCM), and obtain substantial performance gains, both in terms of objective and subjective measures.

Transactions Papers Use of Residual Redundancy in the Design of Joint Source/Channel Coders

TL;DR: In this paper, a technique for providing error protection without the additional overhead required for channel coding is presented, where the residual redundancy can then be used to provide error protection in much the same way as the insertion of redundancy in convolutional coding provides error protection.
Journal ArticleDOI

Optimal detection of discrete Markov sources over discrete memoryless channels/spl minus/applications to combined source-channel coding

TL;DR: It is shown that the instantaneous MAP detector can be combined with the VQ decoder to form an approximate minimum mean-squared error decoder and the residual redundancy can be used by the MAP detectors to combat channel errors.
Journal ArticleDOI

Channel codes that exploit the residual redundancy in CELP-encoded speech

TL;DR: The objective is to design efficient coding/decoding schemes for the transmission of the CELP line spectral parameters (LSPs) over very noisy channels by quantifying the amount of "residual redundancy" inherent in the LSPs of Federal Standard 1016 CELF.
Related Papers (5)