z-logo
Premium
Multiple description coding over multiple correlated erasure channels
Author(s) -
Zhao Songqing,
Tuninetti Daniela,
Ansari Rashid,
Schonfeld Dan
Publication year - 2012
Publication title -
transactions on emerging telecommunications technologies
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.366
H-Index - 47
ISSN - 2161-3915
DOI - 10.1002/ett.2507
Subject(s) - erasure , coding (social sciences) , binary erasure channel , erasure code , rate–distortion theory , computer science , algorithm , decoding methods , rate distortion , upper and lower bounds , code rate , multiple description coding , mathematics , channel (broadcasting) , mathematical optimization , channel capacity , statistics , telecommunications , mathematical analysis , programming language
This paper examines the use of Multiple Description Coding (MDC) for information transmission over multiple correlated erasure channels. It addresses the problem of optimal rate allocation between descriptions to attain the minimum possible average distortion at the receiver. The rate allocation problem is formulated on the basis of rate‐distortion theory for the general case of unbalanced MDC and under the constraint that the total coding rate is fixed. The channel parameters, that is, erasure rates, for which MDC outperforms Single Description Coding are characterised. It is shown that MDC is optimal when the channel erasure rates are comparable and the total coding rate is large. A heuristic approximation for optimal rate allocation is also presented, which can be readily used in practice to determine the relative rates between descriptions needed to achieve the minimal average distortion. The relationship between the optimal average distortion and the erasure correlation is explored. It is shown that for some cases, such as for equal average erasure probabilities, the average distortion decreases as the channel correlation increases. Copyright © 2012 John Wiley & Sons, Ltd.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here