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

Subbalakshmi, K. P.; Vaisey, J.

doi:10.1109/26.974247

Cited by 41 publications

(17 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Through the restriction among the VLC, those invalid branch paths could be eliminated from the classical convolutional trellis, resulting in a simplified trellis with fewer codeword paths. In 2002, Subbalakshimi proposed a novel bit-level trellis suitable to the BSC channel [67]. However, iterative decoding technology is not applied in Subbalakshimi's JSCD methods, which limits the joint decoding performance.…”

Section: Jscd For Variable-length Coding With Bit-level Decodingmentioning

confidence: 99%

Studies and advances on joint source-channel encoding/decoding techniques in flow media communications

Liu

Zhang

et al. 2010

Sci. China Inf. Sci.

View full text Add to dashboard Cite

Joint source-channel coding/decoding (JSCC/JSCD) techniques in flow media communications have become a state-of-the-art and one of the challenging research subjects in the spatial communication area. They have great application prospective and deep impact in various manned space flights, satellite missions, mobile radio communications and deep-space explorations. In the last few years, there have been influential achievements in JSCC/JSCD studies. This paper aims at an introduction to the basic principles of joint source-channel optimal design. A general summarization and classification for various existing JSCC/JSCD methods is addressed. Also presented is a JSCD scheme based on variable-length coding, capable of providing reliable resolutions for flow media data transmission in spatial communications.

show abstract

Section: Jscd For Variable-length Coding With Bit-level Decodingmentioning

confidence: 99%

Studies and advances on joint source-channel encoding/decoding techniques in flow media communications

Liu

Zhang

et al. 2010

Sci. China Inf. Sci.

View full text Add to dashboard Cite

show abstract

“…[2][3][4] consider only source decoding but not channel decoding, Refs. [5][6][7] are based on a bit-level but not on a symbol-level. Ref.…”

Section: Introductionmentioning

confidence: 99%

“…Some bit-based VLC decoding trellises representation are proposed in Refs. [5][6][7], which utilize the classical BCJR algorithm [8] to calculate maximum a-posteriori probability (MAP). A decoding algorithm for variable-length coded (VLCed) Markov sources based on a three-dimensional (3-D) trellis is presented in Ref.…”

Section: Introductionmentioning

confidence: 99%

Integrated joint source-channel decoding for H.264 video transmission

Chen

2007

Wuhan Univ. J. of Nat. Sci.

View full text Add to dashboard Cite

This paper proposes an integrated joint source-channel decoder (I-JSCD) using Max-Log-MAP method for sources encoded with exp-Golomb codes and convolutional codes, and proposes a system applying this method to decoding the VLC data, e.g. motion vector differences (MVDs), of H.264 across an AWGN channel. This method combines the source code state-space and the channel code state-space together to construct a joint state-space, develops a 3-D trellis and a maximum a-posterior (MAP) algorithm to estimate the source sequence symbol by symbol, and then uses max-log approximation to simplify the algorithm. Experiments indicate that the proposed system gives significant improvements on peak signal-to-noise ratio (PSNR) (maximum about 15 dB) than a separate scheme. This also leads to a higher visual quality of video stream over a highly noisy channel.

show abstract

“…Several authors have proposed optimal decoding algorithms for VLC systems: A bit-level VLC decoding trellis representation is proposed in Ref. [1][2][3][4], which allows to use the BCJR algorithm [5] as a-posteriori probability (APP) decoder. A symbol-level trellis representation for variable-length encoded source data is presented in Ref.…”

Section: Introductionmentioning

confidence: 99%

“…However, the methods in Ref. [1][2][3][4] are based on a bit-level but not a symbol-level, so they can not avoid losses of synchronization in the source decoding stage. The methods in Ref.…”

Section: Introductionmentioning

confidence: 99%

Integrated joint source-channel symbol-by-symbol decoding of variable-length codes using 3-D MAP sequence estimation

Chen

2007

Wuhan Univ. J. of Nat. Sci.

View full text Add to dashboard Cite

Most of multimedia schemes employ variable-length codes (VLCs) like Huffman code as core components in obtaining high compression rates. However VLC methods are very sensitive to channel noise. The goal of this paper is to salvage as many data from the damaged packets as possible for higher audiovisual quality. This paper proposes an integrated joint source-channel decoder (I-JSCD) at a symbol-level using three-dimensional (3-D) trellis representation for first-order Markov sources encoded with VLC source code and convolutional channel code. This method combines source code and channel code state-spaces and bit-lengths to construct a two-dimensional (2-D) state-space, and then develops a 3-D trellis and a maximum a-posterior (MAP) algorithm to estimate the source sequence symbol by symbol. Experiment results demonstrate that our method results in significant improvement in decoding performance, it can salvage at least half of (50%) data in any channel error rate, and can provide additional error resilience to VLC stream like image, audio, video stream over high error rate links.

show abstract

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

Cited by 41 publications

References 7 publications

Studies and advances on joint source-channel encoding/decoding techniques in flow media communications

Studies and advances on joint source-channel encoding/decoding techniques in flow media communications

Integrated joint source-channel decoding for H.264 video transmission

Integrated joint source-channel symbol-by-symbol decoding of variable-length codes using 3-D MAP sequence estimation

Contact Info

Product

Resources

About