Joint speech codec parameter and channel decoding of parameter individual block codes (PIBC)

Fingscheidt, Tim; Heinen, Stefan; Vary, Peter

doi:10.1109/scft.1999.781489

Cited by 13 publications

(4 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Applications of this concept to non-iterative joint sourcechannel coding schemes can be found in [16,17]. The bit interleaver π scrambles the incoming frame x τ of data bits tox τ in a deterministic manner.…”

Section: A Iterative Source-channel Decoding (Iscd)mentioning

confidence: 99%

Hybrid ARQ with Incremental Redundant Index Assignments for Iterative Source-Channel Decoding

Clevorn

Schmalen

Vary

et al. 2010

2010 IEEE International Conference on Communications

Self Cite

View full text Add to dashboard Cite

Iterative source-channel decoding (ISCD) exploits the residual redundancy of source codec parameters by using the Turbo principle. In this paper we extend the excellent capabilities of ISCD to a hybrid automatic repeat request (HARQ) scheme by novel incremental redundant index assignments. The incremental redundancy for HARQ is supplied by the source encoder and not the channel encoder. Simulation results show an excellent performance over a wide range of channel conditions, with inherently adapted bandwidth and complexity.

show abstract

Section: A Iterative Source-channel Decoding (Iscd)mentioning

confidence: 99%

Hybrid ARQ with Incremental Redundant Index Assignments for Iterative Source-Channel Decoding

Clevorn

Schmalen

Vary

et al. 2010

2010 IEEE International Conference on Communications

Self Cite

View full text Add to dashboard Cite

show abstract

“…The benefits of the latter approach with Q ⋆ < 2 M ⋆ over the obvious choice Q ⋆ = 2 M ⋆ in case of channel errors have been analyzed in detail in [7]. Such an index assignment with Q ⋆ < 2 M ⋆ can be considered as a (potentially non-linear) block code with the binary representation of the quantizer level index {ξ } 2 , ξ = 0, ... Q ⋆ − 1, as input (see also [11,12] for non-iterative schemes). In case of an index assignment by a linear block code with generator matrix G Γ we get [8] x…”

Section: Iscd With Redundant Index Assignmentsmentioning

confidence: 99%

Iterative Source–Channel Decoding

Hanzo

Maunder

Wang

2010

Near‐Capacity Variable‐Length Coding

View full text Add to dashboard Cite

The exploitation of the residual redundancy of source codec parameters by using the Turbo principle is known as iterative source-channel decoding (ISCD). The concept of redundant index assignments was proposed as a powerful improvement for ISCD. In this contribution design and optimization guidelines for such redundant index assignments are presented. Commonly, the redundant index assignment is based on a simple block code. Using extrinsic information transfer (EXIT) chart we demonstrate that weak block codes such as a repetition code should be preferred. Simulation results show significant performance improvements with redundant index assignments based on this guideline.

show abstract

“…The family of JSCD schemes often relies on exploiting the residual redundancy in the source-coded bit stream. Fingscheidt and Vary [9] and Fingscheidt et al [10] proposed soft-bit source decoding (SBSD) to exploit the natural residual redundancy of the source-coded bit stream for improving the convergence of iterative source-channel decoding (ISCD) [11], [12]. However, only moderate residual redundancy is left in the sourcecoded bit stream when using advanced state-of-the-art coding techniques.…”

Section: Exit-chart Optimized Short Block Codes For Iterative Joint Smentioning

confidence: 99%

EXIT-Chart Optimized Short Block Codes for Iterative Joint Source and Channel Decoding in H.264 Video Telephony

Nasruminallah

Hanzo

2009

IEEE Trans. Veh. Technol.

View full text Add to dashboard Cite

Abstract-In this paper, we propose a family of short block codes (SBCs) designed for guaranteed convergence in soft-bitassisted iterative joint source and channel decoding, which facilitate improved iterative soft-bit source decoding (SBSD) and channel decoding. Data-partitioned (DP) H.264 source-coded video is used to evaluate the performance of our system using SBCassisted SBSD, in conjunction with recursive systematic convolution (RSC) codes for transmission over correlated narrow-band Rayleigh fading channels. The effect of different SBC schemes having diverse minimum Hamming distances d H,min and code rates on the attainable system performance is demonstrated, when using iterative SBSD and channel decoding, while keeping the overall bit rate budget constant by appropriately partitioning the total available bit rate budget between the source and channel codecs to improve the overall bit error rate (BER) performance and to enhance the objective video quality expressed in terms of peak signal-to-noise ratio (PSNR).1 EXtrinsic Information Transfer (EXIT) charts were used to analyze the attainable system performance. Explicitly, our experimental results show that the proposed error protection scheme using rate-1/3 SBCs having d H,min = 6 outperforms the identical-rate SBCs having d H,min = 3 by about 2.25 dB at the PSNR degradation point of 1 dB. Additionally, an E b /N 0 gain of 9 dB was achieved, compared with the rate-5/6 SBC having d H,min = 2 and an identical overall code rate. Furthermore, an E b /N 0 gain of 25 dB is attained at the PSNR degradation point of 1 dB while using iterative soft-bit source and channel decoding with the aid of rate-1/3 SBCs relative to the identical-rate benchmarker. . However, only moderate residual redundancy is left in the sourcecoded bit stream when using advanced state-of-the-art coding techniques. Therefore, we propose to deliberately impose additional redundancy on the source-coded bit stream with the aid of the novel class of SBCs proposed. In our experimental setup, the H.264/AVC video codec [13] is used to encode the input video sequence and generate the source-coded bit stream. The H.264/AVC codec employs heterogeneous variable length coding and predictive coding techniques to achieve high compression efficiency, which makes the compressed bit stream susceptible to transmission errors [1]. A single bit error in the coded stream may corrupt the decoding of numerous future codewords. Moreover, due to predictive coding, the effects of channel errors may affect the neighboring video blocks due to error propagation. Therefore, the transmission of compressed video over wireless systems is a challenging task. Various errorresilient schemes have been proposed in [1] to alleviate these problems, but the price paid is potential reduction in the achievable compression efficiency and increase in computational complexity. An iterative joint source-channel decoding procedure inspired by the concept of serial concatenated codes was presented in [14]. A symbol-based soft-input a post...

show abstract

Joint speech codec parameter and channel decoding of parameter individual block codes (PIBC)

Cited by 13 publications

References 5 publications

Hybrid ARQ with Incremental Redundant Index Assignments for Iterative Source-Channel Decoding

Hybrid ARQ with Incremental Redundant Index Assignments for Iterative Source-Channel Decoding

Iterative Source–Channel Decoding

EXIT-Chart Optimized Short Block Codes for Iterative Joint Source and Channel Decoding in H.264 Video Telephony

Contact Info

Product

Resources

About