Optimal Erasure Protection Assignment for Scalable Compressed Data with Small Channel Packets and Short Channel Codewords
Optimal Erasure Protection Assignment for Scalable Compressed Data with Small Channel Packets and Short Channel Codewords
复制标题
具有小信道数据包和短信道码字的可扩展压缩数据的最佳擦除保护分配
DOI：
10.1155/s1110865704308024
复制
发表时间：
2004
影响因子：
1.9
通讯作者：
D. Taubman
中科院分区：
文献类型：
--
作者：
Johnson Thie;D. Taubman
我们关注的是有效传输可扩展的压缩数据，而不是有损通信通道。最近的工作提出了几种策略，将最佳代码冗余分配给可扩展数据流中的元素，假设所有元素均已编码到一个通用的网络数据包中。与网络数据包的大小相比，当要编码的数据的大小变得很大时，此类方案需要具有很高的计算复杂性的很长的通道代码。在损失高的网络中，小数据包通常比长数据包更为可取。本文提出了一种强大的策略，可将可扩展数据的元素最佳地分配给数据包群，但要受到数据包大小和代码复杂性的约束。给定数据包群集排列，该方案然后将最佳代码冗余分配给源元素受到传输长度约束的源。实验结果表明，所提出的策略可以胜过以前提出的代码冗余分配政策，但要受到上述约束，尤其是在高通道损耗率下。
We are concerned with the efficient transmission of scalable compressed data over lossy communication channels. Recent works have proposed several strategies for assigning optimal code redundancies to elements in a scalable data stream under the assumption that all elements are encoded onto a common group of network packets. When the size of the data to be encoded becomes large in comparison to the size of the network packets, such schemes require very long channel codes with high computational complexity. In networks with high loss, small packets are generally more desirable than long packets. This paper proposes a robust strategy for optimally assigning elements of the scalable data to clusters of packets, subject to constraints on packet size and code complexity. Given a packet cluster arrangement, the scheme then assigns optimal code redundancies to the source elements subject to a constraint on transmission length. Experimental results show that the proposed strategy can outperform previously proposed code redundancy assignment policies subject to the above-mentioned constraints, particularly at high channel loss rates.