TY - GEN
T1 - Explicit network-adaptive robust multiple description coding
AU - Yang, Meng
AU - Lan, Xuguang
AU - Zheng, Nanning
PY - 2011
Y1 - 2011
N2 - The data delivery performance of multiple description coding (MDC) over unreliable network with capacity constraints is always related with three factors: redundancy rate, packet loss rate (PLR), bit error rate (BER). It is supposed that the packet losses have been settled by MDC with certain redundancy. We simplified the network-adaptive data delivery problem to only relating with the redundancy rate factor, because the bit-error resilience of the system can be self-adaptively guaranteed well enough for any redundancy case by the proposed codeword ordering method. Then the problem becomes explicit, and is easily and precisely solved by the proposed iterative redundancy control method. The proposed scheme is an extension of scalar quantization (SQ) based MDC, either balanced or unbalanced case. The related index assignment (IA) problem is well solved, and the R-D bound is proved trending to be optimal. This method can be incorporated into any SQ-based MDC system to simplify the network-adaptive delivery problem, fully considering the related factors.
AB - The data delivery performance of multiple description coding (MDC) over unreliable network with capacity constraints is always related with three factors: redundancy rate, packet loss rate (PLR), bit error rate (BER). It is supposed that the packet losses have been settled by MDC with certain redundancy. We simplified the network-adaptive data delivery problem to only relating with the redundancy rate factor, because the bit-error resilience of the system can be self-adaptively guaranteed well enough for any redundancy case by the proposed codeword ordering method. Then the problem becomes explicit, and is easily and precisely solved by the proposed iterative redundancy control method. The proposed scheme is an extension of scalar quantization (SQ) based MDC, either balanced or unbalanced case. The related index assignment (IA) problem is well solved, and the R-D bound is proved trending to be optimal. This method can be incorporated into any SQ-based MDC system to simplify the network-adaptive delivery problem, fully considering the related factors.
UR - https://www.scopus.com/pages/publications/79955704686
U2 - 10.1109/DCC.2011.88
DO - 10.1109/DCC.2011.88
M3 - 会议稿件
AN - SCOPUS:79955704686
SN - 9780769543529
T3 - Data Compression Conference Proceedings
SP - 485
BT - Proceedings - DCC 2011
T2 - 2011 Data Compression Conference, DCC 2011
Y2 - 29 March 2011 through 31 March 2011
ER -