Source-Optimized Channel Coding for Digital Transmission Channels

Heinen, Stefan; Vary, Peter

doi:10.1109/tcomm.2005.844936

Cited by 23 publications

(13 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Highly redundant index assignments for ISCD were proposed in [4]. A related concept for the non-iterative case has been presented in [10]. In comparison to a conventional ISCD scheme with channel coding of rate rC , the number of bits assigned to each quantizer levelū (ξκ) κ can be increased by a factor of 1/rC , if we assume a constant gross bit rate.…”

Section: Redundant Index Assignmentsmentioning

confidence: 99%

Iterative Source-Channel Decoding Using Short Block Codes

Clevorn

Vary

Adrat

2006 IEEE International Conference on Acoustics Speed and Signal Processing Proceedings

Self Cite

View full text Add to dashboard Cite

Iterative source-channel decoding (ISCD) exploits the residual redundancy of the source, e.g., codec parameters, for quality improvements. In contrast to the well-known convolutional coded ISCD systems, we propose in this paper an ISCD scheme which features a superior performance but is based solely on two short block codes. The block codes serve as highly redundant index assignment and rate-1 inner channel code respectively. The improved capabilities are confirmed by EXIT charts. Finally, the effects of imperfect knowledge of the receiver on the residual redundancy are analyzed. With the proposed flexible index assignment no feedback from the receiver to the transmitter is required and competitive results are obtained even for slightly erroneously estimated residual redundancy.

show abstract

Section: Redundant Index Assignmentsmentioning

confidence: 99%

Iterative Source-Channel Decoding Using Short Block Codes

Clevorn

Vary

Adrat

2006 IEEE International Conference on Acoustics Speed and Signal Processing Proceedings

Self Cite

View full text Add to dashboard Cite

show abstract

“…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

“…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 noniterative schemes). In case of an index assignment by a linear block code with generator matrix G Γ we get [8] …”

Section: B Iscd With Redundant Index Assignmentsmentioning

confidence: 99%

On redundant index assignments for iterative source-channel decoding

et al. 2008

View full text Add to dashboard Cite

Abstract-Iterative source-channel decoding (ISCD) exploits the residual redundancy of source codec parameters by using the Turbo principle. A powerful improvement for ISCD is the concept of redundant index assignments. In this letter we present new design and optimization guidelines for redundant index assignments. For block code based redundant index assignments, weak block codes such as a repetition code should be preferred. Simulation results show significant performance improvements.

show abstract

Source-Optimized Channel Coding for Digital Transmission Channels

Cited by 23 publications

References 24 publications

Iterative Source-Channel Decoding Using Short Block Codes

Iterative Source-Channel Decoding Using Short Block Codes

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

On redundant index assignments for iterative source-channel decoding

Contact Info

Product

Resources

About